Sciweavers

4488 search results - page 86 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
MODELS
2007
Springer
15 years 9 months ago
Finding the Pattern You Need: The Design Pattern Intent Ontology
Abstract. Since the seminal book by the Gang of Four, design patterns have proven an important tool in software development. Over time, more and more patterns have been discovered ...
Holger Kampffmeyer, Steffen Zschaler
AUSAI
2003
Springer
15 years 8 months ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar
CG
2002
Springer
15 years 3 months ago
PDS-PN: A New Proof-Number Search Algorithm
Abstract. The paper introduces a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search, which performs at the first level a depth-first Proof-number and D...
Mark H. M. Winands, Jos W. H. M. Uiterwijk, H. Jaa...
ICRA
2002
IEEE
111views Robotics» more  ICRA 2002»
15 years 8 months ago
Mission Planning for the Sun-Synchronous Navigation Field Experiment
This paper describes TEMPEST, a planner that enables a solar-powered rover to reason about path selection and event placement in terms of available solar energy and anticipated po...
Paul Tompkins, Anthony Stentz, William Whittaker
116
Voted
AAAI
1990
15 years 4 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih