986 search results - page 69 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
154
Voted
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
135
click to vote
SIAMDM
2008
15 years 3 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
89
Voted
IPL
2008
15 years 3 months ago
2008
We define and solve a simple extension of the ski-rental problem [4]. In the classical version, the algorithm needs to decide when to switch from renting to buying. In our version...
148
Voted
CIMCA
2008
IEEE
15 years 10 months ago
2008
IEEE
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
138
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...