477 search results - page 73 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
PODC
2010
ACM
13 years 11 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
ICCAD
1994
IEEE
13 years 11 months ago
1994
IEEE
In this paper, we study the simultaneousdriver and wire sizing (SDWS) problem under two objective functions: (i) delay minimization only, or (ii) combined delay and power dissipat...
COR
2007
13 years 7 months ago
2007
This paper deals with the generation of minimal risk paths for the road transportation of hazardous materials between an origin–destination pair of a given regional area. The ma...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
STOC
2004
ACM
14 years 7 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...