986 search results - page 63 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
153
click to vote
COLT
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...
138
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
162
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
148
click to vote
COR
2008
15 years 5 months ago
2008
An approach is proposed for generating homogenous three-staged cutting patterns for the constrained two-dimensional guillotinecutting problems of rectangles. It is based on branch...
154
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...