5263 search results - page 563 / 1053 » Open Constraint Optimization |
187
click to vote
NIPS
2007
15 years 8 months ago
2007
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
160
click to vote
PDPTA
2007
15 years 8 months ago
2007
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
175
click to vote
CDES
2006
15 years 8 months ago
2006
The ability to improve the yield of integrated circuits through layout modification has been recognized and several techniques for yield enhanced routing and compaction have been ...
162
click to vote
ESANN
2006
15 years 8 months ago
2006
Abstract. We present experimental results about learning function values (i.e. Bellman values) in stochastic dynamic programming (SDP). All results come from openDP (opendp.sourcef...
208
click to vote
IJCAI
2003
15 years 8 months ago
2003
We empirically study phase transitions of the asymmetric Traveling Salesman. Using random instances of up to 1,500 cities, we show that many properties of the problem, including t...