1814 search results - page 169 / 363 » Improved Results on Geometric Hitting Set Problems |
189
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
A significant challenge in developing planning systems for practical applications is the difficulty of acquiring the domain knowledge needed by such systems. One method for acquir...
158
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
169
click to vote
ASPDAC
1999
ACM
15 years 10 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
181
click to vote
IJCAI
1997
15 years 7 months ago
1997
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...
200
click to vote
ICAI
2010
15 years 4 months ago
2010
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...