4679 search results - page 145 / 936 » Modeling When Connections Are the Problem |
118
click to vote
DIALM
2010
ACM
14 years 11 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
108
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bdi logic. ...
111
click to vote
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
Mediation is the process of decomposing a task into subtasks, finding agents suitable for these subtasks and negotiating with agents to obtain commitments to execute these subtas...
155
click to vote
ICNP
2002
IEEE
15 years 6 months ago
2002
IEEE
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
101
click to vote
AOSE
2001
Springer
15 years 6 months ago
2001
Springer
Two key issues in building multi-agent systems concern their scalability and engineering open systems. We offer solutions to these potential problems by introducing a lifecycle fo...