3415 search results - page 601 / 683 » Lower Bounds for Kernelizations |
167
click to vote
MST
2011
14 years 11 months ago
2011
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...
154
click to vote
DC
2010
14 years 11 months ago
2010
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...
151
click to vote
TALG
2011
14 years 11 months ago
2011
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...
209
click to vote
TAPAS
2011
14 years 11 months ago
2011
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...
121
click to vote
TOMS
2011
14 years 11 months ago
2011
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 = ...