Sciweavers

243 search results - page 32 / 49
» How to Solve It Automatically: Selection Among Problem Solvi...
Sort
View
ATAL
2003
Springer
14 years 22 days ago
Information-driven phase changes in multi-agent coordination
Large systems of agents deployed in a real-world environment face threats to their problem solving performance that are independent of the complexity of the problem or the charact...
Sven Brueckner, H. Van Dyke Parunak
RAS
2007
161views more  RAS 2007»
13 years 7 months ago
Multi-robot mobility enhanced hop-count based localization in ad hoc networks
The localization problem is important in mobile robots and wireless sensor network and has been studied for many years. Among many localization methods, the hop-count based approa...
Terence Chung Hsin Sit, Zheng Liu, Marcelo H. Ang ...
IJCAI
1989
13 years 8 months ago
Reasoning About Assumptions in Graphs of Models
Solving design and analysis problems in physical worlds requires the representatio n of large amounts of knowledge. Recently, there has been much interest in explicitly making ass...
Sanjaya Addanki, Roberto Cremonini, J. Scott Penbe...
JAR
2000
123views more  JAR 2000»
13 years 7 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
ECCV
2004
Springer
14 years 9 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla