Sciweavers

2100 search results - page 195 / 420
» Observation Can Be as Effective as Action in Problem Solving
Sort
View
JCO
2010
101views more  JCO 2010»
15 years 5 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
ATAL
2007
Springer
16 years 22 days ago
Diagnosis of plan step errors and plan structure violations
Failures in plan execution can be attributed to errors in the execution of plan steps or violations of the plan structure. The structure of a plan prescribes which actions have to...
Cees Witteveen, Nico Roos, Adriaan ter Mors, Xiaoy...
ATAL
2005
Springer
16 years 3 days ago
How local is that optimum? k-optimality for DCOP
In multi-agent systems where sets of joint actions (JAs) are generated, metrics are needed to evaluate these sets and efficiently allocate resources for the many JAs. For the case...
Jonathan P. Pearce, Rajiv T. Maheswaran, Milind Ta...
ATAL
1999
Springer
15 years 10 months ago
A Planning Component for RETSINA Agents
In the RETSINA multi-agent system, each agent is provided with an internal planning component—the RETSINA planner. Each agent, using its internal planner, formulates detailed pla...
Massimo Paolucci, Onn Shehory, Katia P. Sycara, Di...
ALP
1992
Springer
15 years 10 months ago
Definitional Trees
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
Sergio Antoy