3020 search results - page 470 / 604 » Optimal partition trees |
143
click to vote
AAAI
2006
15 years 7 months ago
2006
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
150
click to vote
EACL
2006
ACL Anthology
15 years 7 months ago
2006
ACL Anthology
We present a model for sentence compression that uses a discriminative largemargin learning framework coupled with a novel feature set defined on compressed bigrams as well as dee...
130
click to vote
IJCAI
2001
15 years 7 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
184
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
177
click to vote
PDPTA
2003
15 years 7 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...