3415 search results - page 430 / 683 » Lower bounds on kernelization |
142
click to vote
ADHOC
2008
15 years 6 months ago
2008
In this paper, we study asymptotic uniform data-rate guarantees in large wireless networks from an information-theoretic viewpoint. We consider the following question: what is the...
166
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but...
177
click to vote
AIEDAM
2008
15 years 6 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
155
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
168
click to vote
CAS
2008
15 years 6 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...