986 search results - page 92 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
137
click to vote
JAIR
2007
15 years 3 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
144
Voted
MOR
2010
15 years 2 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
120
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
153
Voted
PODC
2009
ACM
16 years 25 days ago
2009
ACM
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...
128
Voted
CAV
2007
Springer
15 years 9 months ago
2007
Springer
ng-Lens Abstraction for Markov Decision Processes⋆ In Proc. of CAV 2007: 19th International Conference on Computer-Aided Verification, Lectures Notes in Computer Science. c Spri...