986 search results - page 133 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
122
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
114
Voted
WADS
2007
Springer
15 years 9 months ago
2007
Springer
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
108
click to vote
ICCD
2003
IEEE
16 years 17 days ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
248
Voted
ASUNAM
2011
IEEE
14 years 3 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
118
Voted
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...