6562 search results - page 140 / 1313 » Noetherianity and Combination Problems |
177
click to vote
SODA
2007
ACM
15 years 7 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
171
click to vote
AAAI
2006
15 years 7 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
164
Voted
FLAIRS
2004
15 years 7 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
323
Voted
EOR
2007
15 years 5 months ago
2007
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
181
click to vote
4OR
2008
15 years 4 months ago
2008
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the ...