Sciweavers

2200 search results - page 416 / 440
» Bloch's Constant is Computable
Sort
View
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 3 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
ADHOCNOW
2004
Springer
15 years 3 months ago
A Rate-Adaptive MAC Protocol for Low-Power Ultra-Wide Band Ad-Hoc Networks
Recent theoretical results show that it is optimal to allow interfering sources to transmit simultaneously as long as they are outside a well-defined exclusion region around a de...
Ruben Merz, Jean-Yves Le Boudec, Jörg Widmer,...
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 3 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
GD
2004
Springer
15 years 3 months ago
Layouts of Graph Subdivisions
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
Vida Dujmovic, David R. Wood
ICALP
2004
Springer
15 years 3 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella