Sciweavers

2916 search results - page 355 / 584
» The simulation power of automod
Sort
View
ATAL
2010
Springer
15 years 7 months ago
Ants meeting algorithms
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
Asaf Shiloni, Alon Levy, Ariel Felner, Meir Kalech
AUTOMATICA
2008
89views more  AUTOMATICA 2008»
15 years 6 months ago
Dynamic buffer management using optimal control of hybrid systems
This paper studies a general dynamic buffer management problem with one buffer inserted between two interacting components. The component to be controlled is assumed to have multi...
Wei Zhang, Jianghai Hu
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 6 months ago
Randomness for Free
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 6 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
JNW
2006
118views more  JNW 2006»
15 years 6 months ago
UMTS Capacity and Throughput Maximization for Different Spreading Factors
An analytical model for calculating capacity in multi-cell UMTS networks is presented. Capacity is maximized for different spreading factors and for perfect and imperfect power con...
Robert Akl, Son Nguyen