314 search results - page 47 / 63 » A Constraint Based Agent for TAC-SCM |
IAT
2007
IEEE
14 years 1 months ago
2007
IEEE
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
AAAI
2008
13 years 9 months ago
2008
The paper presents a calculus based on resolution for credulous reasoning in Answer Set Programming. The new approach allows a top-down and goal directed resolution, in the same s...
AAAI
2004
13 years 8 months ago
2004
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...
AAAI
2000
13 years 8 months ago
2000
A new approach to evolutionary computation, called Learnable Evolution Model (LEM), has been applied to the problem of optimizing tube structures of heat exchangers. In contrast t...