10051 search results - page 1880 / 2011 » A Dynamic Separator Algorithm |
123
click to vote
DMSN
2007
ACM
15 years 6 months ago
2007
ACM
This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm1 . Our objectives are to explore a given geographic region by detecting and aggregating sp...
117
Voted
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
122
Voted
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
This paper proposes an efficient agent for competing in Cliff Edge (CE) environments, such as sealed-bid auctions, dynamic pricing and the ultimatum game. The agent competes in on...
128
Voted
PLDI
1995
ACM
15 years 6 months ago
1995
ACM
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
130
Voted
ASMTA
2008
Springer
15 years 4 months ago
2008
Springer
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...