Sciweavers

228 search results - page 33 / 46
» Expected Reachability-Time Games
Sort
View
HIPC
2005
Springer
14 years 2 months ago
Cost-Optimal Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems
Abstract. This paper formulates the job allocation problem in distributed systems with bandwidth-constrained nodes. The bandwidth limitations of the nodes play an important role in...
Preetam Ghosh, Kalyan Basu, Sajal K. Das
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
14 years 1 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
IFIP
2003
Springer
14 years 1 months ago
Equilibrium Analysis of Packet Forwarding Strategies in Wireless Ad Hoc Networks - The Static Case
In multi-hop wireless networks, every node is expected to forward packets for the benefit of other nodes. Yet, if each node is its own authority, then it may selfishly deny packe...
Márk Félegyházi, Levente Butt...
AAAI
2006
13 years 10 months ago
Know Thine Enemy: A Champion RoboCup Coach Agent
In a team-based multiagent system, the ability to construct a model of an opponent team's joint behavior can be useful for determining an agent's expected distribution o...
Gregory Kuhlmann, William B. Knox, Peter Stone
UAI
2004
13 years 10 months ago
The Minimum Information Principle for Discriminative Learning
Exponential models of distributions are widely used in machine learning for classification and modelling. It is well known that they can be interpreted as maximum entropy models u...
Amir Globerson, Naftali Tishby