Sciweavers

18306 search results - page 418 / 3662
» Algorithmics in Exponential Time
Sort
View
216
Voted
DSD
2009
IEEE
111views Hardware» more  DSD 2009»
16 years 2 months ago
Robustness Check for Multiple Faults Using Formal Techniques
Feature sizes in VLSI circuits are steadily shrinking. This results in increasing susceptibility to soft errors, e.g. due to environmental radiation. Precautions against soft error...
Stefan Frehse, Görschwin Fey, André S&...
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
16 years 2 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
196
Voted
CONCUR
2009
Springer
16 years 2 months ago
Winning Regions of Pushdown Parity Games: A Saturation Method
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
Matthew Hague, C.-H. Luke Ong
190
Voted
ICC
2008
IEEE
142views Communications» more  ICC 2008»
16 years 1 months ago
Contention Window and Transmission Opportunity Adaptation for Dense IEEE 802.11 WLAN Based on Loss Differentiation
— In high density (HD) WLANs, packet losses can occur due to hidden terminals (asynchronous interference) or collisions (synchronous interference). Without differentiating above ...
Hui Ma, Sumit Roy
ICRA
2007
IEEE
161views Robotics» more  ICRA 2007»
16 years 1 months ago
Manipulation Planning Among Movable Obstacles
— This paper presents the ResolveSpatialConstraints (RSC) algorithm for manipulation planning in a domain with movable obstacles. Empirically we show that our algorithm quickly g...
Mike Stilman, Jan-Ullrich Schamburek, James Kuffne...