Sciweavers

4377 search results - page 510 / 876
» Mass problems and randomness
Sort
View
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
16 years 1 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang
ICALP
2007
Springer
16 years 1 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
IPPS
2006
IEEE
16 years 26 days ago
Hash-based proximity clustering for load balancing in heterogeneous DHT networks
DHT networks based on consistent hashing functions have an inherent load uneven distribution problem. The objective of DHT load balancing is to balance the workload of the network...
Haiying Shen, Cheng-Zhong Xu
IROS
2006
IEEE
202views Robotics» more  IROS 2006»
16 years 26 days ago
Topological characterization of mobile robot behavior
— We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...
Aurélien Hazan, Frédéric Dave...
CCS
2005
ACM
16 years 11 days ago
A model and architecture for pseudo-random generation with applications to /dev/random
We present a formal model and a simple architecture for robust pseudorandom generation that ensures resilience in the face of an observer with partial knowledge/control of the gen...
Boaz Barak, Shai Halevi