Sciweavers

11345 search results - page 379 / 2269
» Foundations of Computer Science
Sort
View
DC
2011
14 years 6 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
CLUSTER
2005
IEEE
16 years 12 days ago
Minimizing the Network Overhead of Checkpointing in Cycle-harvesting Cluster Environments
Cycle-harvesting systems such as Condor have been developed to make desktop machines in a local area (which are often similar to clusters in hardware configuration) available as ...
Daniel Nurmi, John Brevik, Richard Wolski
WPES
2004
ACM
16 years 5 days ago
Privacy preserving route planning
The number of location-aware mobile devices has been rising for several years. As this trend continues, these devices may be able to use their location information to provide inte...
Keith B. Frikken, Mikhail J. Atallah
ALGORITHMICA
2010
107views more  ALGORITHMICA 2010»
15 years 6 months ago
Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly
Abstract Winfree's pioneering work led the foundations in the area of errorreduction in algorithmic self-assembly (Winfree and Bekbolatov in DNA Based Computers 9, LNCS, vol. ...
Sudheer Sahu, John H. Reif
SIGCSE
2009
ACM
213views Education» more  SIGCSE 2009»
16 years 7 months ago
Engaging middle school teachers and students with alice in a diverse set of subjects
This paper describes the integration of the Alice 3D virtual worlds environment into a diverse set of subjects in middle school, including the development of tutorials, example wo...
Susan H. Rodger, Jenna Hayes, Gaetjens Lezin, Henr...