Sciweavers

16091 search results - page 55 / 3219
» Solving
Sort
View
ATAL
2005
Springer
14 years 1 months ago
A distributed framework for solving the Multiagent Plan Coordination Problem
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
Jeffrey S. Cox, Edmund H. Durfee, Thomas Bartold
CP
2005
Springer
14 years 1 months ago
Solving Simple Planning Problems with More Inference and No Search
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
Vincent Vidal, Hector Geffner
SAT
2005
Springer
133views Hardware» more  SAT 2005»
14 years 1 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
DIAGRAMS
2004
Springer
14 years 1 months ago
Predictors of Success in Diagrammatic Problem Solving
Abstract. We conducted an eye-tracking study of mechanical problem solving from cross-sectional diagrams of devices. Response time, accuracy and eye movement data were collected an...
Daesub Yoon, N. Hari Narayanan
AI
2003
Springer
14 years 28 days ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin