2924 search results - page 88 / 585 » Lower Bounds in Distributed Computing |
WADS
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
EUROPAR
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We consider approaches that allow task migration for scheduling recurrent directed-acyclic-graph (DAG) tasks on symmetric, shared-memory multiprocessors (SMPs) in order t...
TIT
2011
13 years 3 months ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
CPM
2010
Springer
14 years 1 months ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...