Sciweavers

JAIR
2006
88views more  JAIR 2006»
13 years 4 months ago
On Graphical Modeling of Preference and Importance
In recent years, CP-nets have emerged as a useful tool for supporting preference elicitation, reasoning, and representation. CP-nets capture and support reasoning with qualitative...
Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Sh...
JAIR
2006
141views more  JAIR 2006»
13 years 4 months ago
An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events
The treatment of exogenous events in planning is practically important in many realworld domains where the preconditions of certain plan actions are affected by such events. In th...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
JAIR
2006
111views more  JAIR 2006»
13 years 4 months ago
Learning in Real-Time Search: A Unifying Framework
Real-time search methods are suited for tasks in which the agent is interacting with an initially unknown environment in real time. In such simultaneous planning and learning prob...
Vadim Bulitko, Greg Lee
JAIR
2006
131views more  JAIR 2006»
13 years 4 months ago
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
Roger Mailler, Victor R. Lesser
JAIR
2006
111views more  JAIR 2006»
13 years 4 months ago
Representing Conversations for Scalable Overhearing
Open distributed multi-agent systems are gaining interest in the academic community and in industry. In such open settings, agents are often coordinated using standardized agent c...
Gery Gutnik, Gal A. Kaminka
JAIR
2006
157views more  JAIR 2006»
13 years 4 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
JAIR
2006
138views more  JAIR 2006»
13 years 4 months ago
Logical Hidden Markov Models
Logical hidden Markov models (LOHMMs) upgrade traditional hidden Markov models to deal with sequences of structured symbols in the form of logical atoms, rather than flat characte...
Kristian Kersting, Luc De Raedt, Tapani Raiko
JAIR
2006
92views more  JAIR 2006»
13 years 4 months ago
Dynamic Local Search for the Maximum Clique Problem
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which...
Wayne J. Pullan, Holger H. Hoos
JAIR
2006
89views more  JAIR 2006»
13 years 4 months ago
Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web
In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we ...
Philippe Adjiman, Philippe Chatalic, Franço...
JAIR
2006
87views more  JAIR 2006»
13 years 4 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy