Sciweavers

3415 search results - page 601 / 683
» Lower Bounds for Kernelizations
Sort
View
MST
2011
209views Hardware» more  MST 2011»
13 years 5 months ago
Spreading of Messages in Random Graphs
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...
Ching-Lueh Chang, Yuh-Dauh Lyuu
DC
2010
13 years 5 months ago
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
Robert Danek, Wojciech M. Golab
TALG
2011
98views more  TALG 2011»
13 years 5 months ago
Tree exploration with logarithmic memory
We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected c...
Christoph Ambühl, Leszek Gasieniec, Andrzej P...
TAPAS
2011
243views Algorithms» more  TAPAS 2011»
13 years 5 months ago
Speed Scaling for Energy and Performance with Instantaneous Parallelism
Abstract. We consider energy-performance tradeoff for scheduling parallel jobs on multiprocessors using dynamic speed scaling. The objective is to minimize the sum of energy consu...
Hongyang Sun, Yuxiong He, Wen-Jing Hsu
TOMS
2011
101views more  TOMS 2011»
13 years 5 months ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...