Sciweavers

13376 search results - page 172 / 2676
» Problem Solving with
Sort
View
AI
2003
Springer
15 years 8 months 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
SEMWEB
2007
Springer
15 years 9 months ago
Solving Semantic Ambiguity to Improve Semantic Web based Ontology Matching
A new paradigm in Semantic Web research focuses on the development of a new generation of knowledge-based problem solvers, which can exploit the massive amounts of formally speci...
Jorge Gracia, Vanessa Lopez, Mathieu d'Aquin, Mart...
MATES
2005
Springer
15 years 8 months ago
The Distributed Weighing Problem: A Lesson in Cooperation Without Communication
Abstract. Cooperative problem solving without communication is an oftenstudied field within multi-agent research. Realistic problems investigated in this particular field are compl...
Tibor Bosse, Mark Hoogendoorn, Catholijn M. Jonker
EVOW
2010
Springer
15 years 8 months ago
Memory Design for Constrained Dynamic Optimization Problems
A proposal for a memory design is given that is suitable for solving constrained dynamic optimization problems by an evolutionary m. Based on ideas from abstract memory, two scheme...
Hendrik Richter
ATAL
2008
Springer
15 years 5 months ago
Solving two-person zero-sum repeated games of incomplete information
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
Andrew Gilpin, Tuomas Sandholm