225 search results - page 15 / 45 » Dynamic Agent Ordering in Distributed Constraint Satisfactio... |
IAT
2003
IEEE
15 years 5 months ago
2003
IEEE
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
110
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
97
Voted
CSCLP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
103
Voted
CSCLP
2006
Springer
15 years 3 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
81
Voted
AAAI
2007
15 years 2 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...