15485 search results - page 290 / 3097 » Computing Optimal Subsets |
164
click to vote
GECCO
2004
Springer
16 years 22 hour ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
202
click to vote
RIVF
2008
15 years 8 months ago
2008
Complex biological data generated from various experiments are stored in diverse data types in multiple datasets. By appropriately representing each biological dataset as a kernel ...
153
click to vote
TON
2002
15 years 6 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
120
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal O(n log n) time and oc...
164
click to vote
DISOPT
2008
15 years 6 months ago
2008
This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decom...