Sciweavers

4377 search results - page 691 / 876
» Mass problems and randomness
Sort
View
149
Voted
INFOCOM
2009
IEEE
16 years 24 days ago
On Mechanism Design without Payments for Throughput Maximization
—It is well-known that the overall efficiency of a distributed system can suffer if the participating entities seek to maximize their individual performance. Consequently, mecha...
Thomas Moscibroda, Stefan Schmid
INFOCOM
2009
IEEE
16 years 24 days ago
Opportunistic Processing and Query of Motion Trajectories in Wireless Sensor Networks
—We study the problem of in-network processing and queries of trajectories of moving targets in a sensor network. The main idea is to exploit the spatial coherence of target traj...
Dengpan Zhou, Jie Gao
IROS
2009
IEEE
132views Robotics» more  IROS 2009»
16 years 24 days ago
Segregation in swarms of mobile robots based on the Brazil nut effect
— We study a simple algorithm inspired by the Brazil nut effect for achieving segregation in a swarm of mobile robots. The algorithm lets each robot mimic a particle of a certain...
Roderich Groß, Stéphane Magnenat, Fra...
APPROX
2009
Springer
99views Algorithms» more  APPROX 2009»
16 years 22 days ago
Resource Minimization Job Scheduling
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
Julia Chuzhoy, Paolo Codenotti
ASIACRYPT
2009
Springer
16 years 22 days ago
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
Vadim Lyubashevsky