225 search results - page 28 / 45 » Dynamic Agent Ordering in Distributed Constraint Satisfactio... |
129
click to vote
ATAL
2003
Springer
15 years 7 months ago
2003
Springer
Given a large group of cooperative agents, selecting the right coordination or conflict resolution strategy can have a significant impact on their performance (e.g., speed of co...
119
Voted
IJCAI
2003
15 years 3 months ago
2003
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
126
click to vote
AAAI
2007
15 years 4 months ago
2007
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Matchmaking is the process of introducing two or more agents to each other. Current matchmaking techniques are unidirectional and fail to address large-scale and highly dynamic sy...
131
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Managing the transactions in real time distributed computing system is not easy, as it has heterogeneously networked computers to solve a single problem. If a transaction runs acr...