813.txt

来自「This complete matlab for neural network」· 文本 代码 · 共 269 行

发信人: roamingo (漫步鸥), 信区: DataMining
标  题: Re: Online Proc. IJCAI'01
发信站: 南京大学小百合站 (Tue Dec 11 13:43:41 2001), 站内信件

Table of Contents of IJCAI'01
=============================
发信人: EGE (EGE), 信区: AI
标  题: Re: IJCAI-FAQ      
发信站: 饮水思源 (2001年12月10日22:55:25 星期一), 站内信件

我最无聊了，列个带序号的索引表出来：（数错了别怪我哦）
共两百篇。                                            
No. Page  
KNOWLEDGE REPRESENTATION AND REASONING
1 : A Logical Account of Causal and Topological Maps
2 : On-Line Execution of cc-Golog Plans             
3 : An On-line Decision-Theoretic Golog Interpreter
4 : Causes and Explanations: A Structural-Model Approach?aPart II: Explanations
5 : Complexity Results for Structure-Based Causality                           
6 : Ambiguity-Directed Sampling for Qualitative Analysis of Sparse Dat
a from Spatially-Distributed Physical Systems                         
7 : A Spatial Odyssey of the Interval Algebra: 1. Directed Intervals
8 : From Images to Bodies: Modelling and Exploiting Spatial Occlusion 
and Motion Parallax                                                   
9 : Qualitative Simulation of Genetic Regulatory Networks: Method and 
Application                                                           
10 : Discrimination of Semi-Quantitative Models by Experiment Selectio
n: Method and Application in Population Biology                       
11 : A Complete Classification of Complexity in Allen?ˉs Algebra in t
he Presence of a Non-Trivial Basic Relation                           
12 : Interval-based Temporal Reasoning with General TBoxes
13 : On the Semantics of Knowledge Update                 
14 : Resource-bounded inference from inconsistent belief bases
15 : Weakening Conflicting Information for Iterated Revision and Knowl
edge Integration
16 : Updates, actions, and planning
17 : Causality and Minimal Change Demystified
18 : EPDL: A Logic for Causal Reasoning
19 : A Circumscriptive Formalization of the Qualification Problem
20 : Computing Strongest Necessary and Weakest Sufficient Conditions o
f First-Order Formulas
21 : Identification Constraints and Functional Dependencies in Descrip
tion Logics
22 : High Performance Reasoning with Very Large Knowledge Bases: A Pra
ctical Case Study
23 : Complexity of Nested Circumscription and Abnormality Theories
24 : A Perspective on Knowledge Compilation
25 : Phase Transitions of PP-Complete Satisfiability Problems
26 : Decision Procedures for Expressive Description Logics with Inters
ection, Composition, Converse of Roles and Role Identity
27 : Ontology Reasoning in the SHOQ(D) Description Logic
28 : The SG Family: Extensions of Simple Conceptual Graphs
29 : Matching under Side Conditions in Description Logics
30 : Computing Least Common Subsumers in 
31 : FCA-MERGE: Bottom-Up Merging of Ontologies
32 : Incomplete Tree Search using Adaptive Probing
33 : Heuristic Search in Infinite State Spaces Guided by Lyapunov Analysis
34 : A backbone-search heuristic for efficient solving of hard 3-SAT formulae
35 : Backbones in Optimization and Approximation
36 : Cooperative Search and Nogood Recording
37 : Search on High Degree Graphs
38 : Backjumping for Quantified Boolean Logic Satisfiability
39 : Solving Non-Boolean Satisfiability Problems with Stochastic Local Search
40 : Backtracking Through Biconnected Components of a Constraint Graph
41 : A Constraint Satisfaction Approach to Parametric Differential Equations
42 : Improved bounds on the complexity of kB-consistency
43 : Refining the Basic Constraint Propagation Algorithm
44 : Making AC-3 an Optimal Algorithm
45 : Temporal Constraint Reasoning With Preferences
46 : A Hybrid Approach for the 0¨C1 Multidimensional Knapsack problem
47 : The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming
48 : A New Method For The Three Dimensional Container Packing Problem
49 : Balance and Filtering in Structured Satisfiable Problems
50 : Efficient Consequence Finding
51 : Formalizing Artistic Techniques and Scientific Visualization for 
Painted Renditions of Complex Information Spaces
52 : Visual Analogy in Problem Solving
53 : Reasoning about Categories in Conceptual Spaces
54 : Simulating the Formation of Color Categories
55 : Grounded Models as a Basis for Intuitive Reasoning
56 : Perceptual Anchoring of Symbols for Action
57 : Planning with Resources and Concurrency: A Forward Chaining Approach
58 : Total-Order Planning with Partially Ordered Subtasks
59 : Conditional progressive planning under uncertainty
60 : One action is enough to plan
61 : Hybrid STAN: Identifying and Managing Combinatorial Optimisation 
Sub- problems in Planning
62 : Local Search Topology in Planning Benchmarks: An Empirical Analysis
63 : Reviving Partial Order Planning
64 : Heuristic Search + Symbolic Model Checking = Efficient Conformant Planning
65 : Planning in Nondeterministic Domains under Partial Observability 
via Symbolic Model Checking
66 : Planning as Model Checking for Extended Goals in Non-deterministic Domains
67 : Executing Reactive, Model-based Programs through Graph-based Temp
oral Planning
68 : Dynamic Control Of Plans With Temporal Uncertainty
69 : Complexity of Probabilistic Planning under Average Rewards
70 : Computational Complexity of Planning with Temporal Goals
71 : A Simplifier for Propositional Formulas with Many Binary Clauses
72 : Iterative Widening
73 : Temporal Difference Learning Applied to a High-Performance Game-P
laying Program
74 : Satisficing and Learning Cooperation in the Prisoner?ˉs Dilemma
75 : Temporal Decision Trees or the lazy ECU vindicated
76 : Model-based Diagnosability and Sensor Placement Application to a 
Frame 6 Gas Turbine Subsystem
77 : Distributed Monitoring of Hybrid Systems: A model-directed approach
78 : Causal interaction: from a high-level representation to an operat
ional event-based representation
79 : Hierarchical Diagnosis Guided by Observations
80 : Mode Estimation of Model-based Programs: Monitoring Systems with 
Complex Behavior
81 : A-System: Problem Solving through Abduction
82 : A Comparative Study of Logic Programs with Preference
83 : Reasoning with infinite stable models
84 : Splitting Without Backtracking
85 : UNSEARCHMO: Eliminating Redundant Search Space on Backtracking fo
r Forward Chaining Theorem Proving
86 : Theorem Proving with Structured Theories
87 : Experimenting with Heuristics for Answer Set Programming
88 : Graph Theoretical Characterization and Computation of Answer Sets
89 : A Framework for Declarative Update Specifications in Logic Programs
90 : Abduction in Logic Programming: A New Definition and an Abductive
 Procedure Based on Rewriting
91 : Context-specific Sign-propagation in Qualitative Probabilistic Networks
92 : Max-norm Projections for Factored MDPs
93 : Solving Factored MDPs via Non-Homogeneous Partitioning
94 : Symbolic Dynamic Programming for First-Order MDPs
95 : Adaptive Control of Acyclic Progressive Processing Task Structures
96 : An Improved Grid-Based Approximation Algorithm for POMDPs
97 : Weakening Commensurability Hypothesis in Possibilistic Qualitativ
e Decision Theory
98 : A Fuzzy Modal Logic for Belief Functions
99 : IBAL: A Probabilistic Rational Programming Language
100 : Approximate inference for first-order probabilistic languages
101 : Knowledge Processing under Information Fidelity
102 : Constraints as Data: A New Perspective on Inferring Probabilities
103 : Knowledge Extraction from Local Function Networks
104 : Violation-Guided Learning for Constrained Formulations in Neural
-Network Time-Series Predictions
105 : Mobile Robot Learning of Delayed Response Tasks through Event Ex
traction: A Solution to the Road Sign Problem and Beyond
106 : NORN Finance Forecaster ?a A Neural Oscillatory-based Recurrent 
Network for Finance Prediction
107 : A General Updating Rule for Discrete Hopfield-Type Neural Networ
k with Delay
108 : Genetic Algorithm based Selective Neural Network Ensemble
109 : Neural Logic Network Learning using Genetic Programming
110 : Sensitivity Analysis of Multilayer Perceptron
111 : Reinforcement Learning in Distributed Domains: Beyond Team Games
112 : Fast Concurrent Reinforcement Learners
113 : Multi-Agent Systems by Incremental Gradient Reinforcement Learning
114 : Robot Weightlifting By Direct Policy Search
115 : OI-implication: Soundness and Refutation Completeness
116 : The Levelwise Version Space Algorithm and its Application to Mol
ecular Fragment Finding
117 : Active Learning for Structure in Bayesian Networks
118 : Probabilistic Classification and Clustering in Relational Data
119 : Adaptive Web Navigation for Wireless Devices
120 : Using Text Classifiers for Numerical Classification
121 : Faster Association Rules for Multiple Relations
122 : A Simple Feature Selection Method for Text Classification
123 : Link Analysis, Eigenvectors and Stability
124 : Active Learning for Class Probability Estimation and Ranking
125 : Learning on the Phase Transition Edge
126 : A Simple Additive Re-weighting Strategy for Improving Margins
127 : Knowledge Analysis on Process Models
128 : Integrating Expectations from Different Sources to Help End User
s Acquire Procedural Knowledge
129 : R-MAX ?a A General Polynomial Time Algorithm for Near-Optimal Re
inforcement Learning
130 : From Q(λ) to Average Q-learning: Efficient Implementation of an
 Asymptotic Approximation
131 : Exploiting Multiple Secondary Reinforcers in Policy Gradient Rei
nforcement Learning
132 : The Foundations of Cost-Sensitive Learning
133 : Mining Soft-Matching Rules from Textual Data
134 : Bridging the Lesson Distribution Gap
135 : Minimizing Dialog Length in Interactive Case-Based Reasoning
136 : SiN: Integrating Case-based Reasoning with Task Decomposition
137 : A Distributed Case-Based Query Rewriting
138 : Using Case-Base Data to Learn Adaptation Knowledge for Design
139 : Rational and Convergent Learning in Stochastic Games
140 : Multi-Agent Influence Diagrams for Representing and Solving Games
141 : Multiagent Coordination by Stochastic Cellular Automata
142 : Identifying the Scope of Modeling for Time-Critical Multiagent D
ecision- Making
143 : A Layered Brain Architecture for Synthetic Creatures
144 : Behavior Planning for a Reflexive Agent
145 : Rational Competitive Analysis
146 : Learning Procedural Knowledge to Better Coordinate
147 : Fair Imposition
148 : Robust Multi-unit Auction Protocol against False-name Bids
149 : Bundle Design in Robust Combinatorial Auction Protocol against F
alse-name Bids
150 : CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
151 : A software architecture for dynamically generated adaptive Web stores
152 : Modularity and Design in Reactive Intelligence
153 : Reflective Negotiating Agents for Real-Time Multisensor Target Tracking
154 : Stable Strategies for Sharing Information among Agents
155 : CAST: Collaborative Agents for Simulating Teamwork
156 : Market Clearability
157 : On Market-Inspired Approaches to Propositional Satisfiability
158 : Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges
159 : Agent-Human Interactions in the Continuous Double Auction
160 : Usability Guidelines for Interactive Search in Direct Manipulation Systems
161 : Leveraging Data About Users in General in the Learning of Indivi
dual User Models
162 : An Agent Architecture for Multi-Attribute Negotiation
163 : A Multiagent System for Helping Urban Traffic Management
164 : Bidding Languages for Combinatorial Auctions
165 : Partitioning Activities for Agents
166 : Title Generation for Machine-Translated Documents
167 : Dealing with Dependencies between Content Planning and Surface R
ealisation in a Pipeline Generation Architecture
168 : Narrative Prose Generation
169 : Adaptive Information Extraction from Text by Rule Induction and 
Generalisation
170 : Relational Learning via Propositional Algorithms: An Information
 Extraction Case Study
171 : Deriving a multi-domain information extraction system from a rou
gh ontology
172 : Representing Sentence Structure in Hidden Markov Models for Info
rmation Extraction
173 : Sequentially finding the N-Best List in Hidden Markov Models
174 : NLP-driven IR: Evaluating Performances over a Text Classification task
175 : Dialog-driven Adaptation of Explanations of Proofs
176 : Generating Tailored Examples to Support Learning via Self-explanation
177 : An Empirical Study of the Influence of User Tailoring on Evaluat
ive Argument Effectiveness
178 : Refining the Structure of a Stochastic Context-Free Grammar
179 : Automatically Extracting and Comparing Lexicalized Grammars for 
Different Languages
180 : Combining Probabilities, Failures and Safety in Robot Control
181 : Heterogeneity in the Coevolved Behaviors of Mobile Robots: The E
mergence of Specialists
182 : Agent-Based Control for Object Manipulation with Modular Self-re
configurable Robots
183 : Learning Iterative Image Reconstruction
184 : A Hierarchy of Boundary-based Shape Descriptors
185 : Resolving Ambiguities to Create a Natural Computer-Based Sketchi
ng Environment
186 : VAMBAM: View and Motion-based Aspect Models for Distributed Omni
directional Vision Systems
187 : Efficient Interpretation Policies
188 : Perceptual Texture Space Improves Perceptual Consistency of Comp
utational Features
189 : Fuzzy Conceptual Graphs for Matching Images of Natural Scenes
190 : Discriminating Animate from Inanimate Visual Stimuli
191 : An Hybrid Approach to Solve the Global Localization Problem For 
Indoor Mobile Robots Considering Sensor?ˉs Perceptual Limitations
192 : Multimodal Integration ?a A Biological View
193 : Real-Time Auditory and Visual Multiple-Object Tracking for Humanoids
194 : A Web-based Intelligent System for the Daya Bay Contingency Plan
 in Hong Kong
195 : ExpertClerk: Navigating Shoppers?ˉ Buying Process with the Comb
ination of Asking and Proposing
196 : Preference-Based Configuration of Web Page Content
197 : Keyword Spices: A New Method for Building Domain-Specific Web Se
arch Engines
198 : Multimodal Interaction: A new focal area for AI
199 : Plausibility Measures: A General Approach For Representing Uncertainty
200 : Robust Translation of Spontaneous Speech: A Multi-Engine Approach

--
Read digitally, save a tree.

※ 来源:．南京大学小百合站 bbs.nju.edu.cn．[FROM: 202.120.7.27]