2124 search results - page 310 / 425 » An Efficient Framework for Order Optimization |
143
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
176
click to vote
MANSCI
2008
15 years 6 months ago
2008
We study large-scale service systems with multiple customer classes and many statistically identical servers. The following question is addressed: How many servers are required (s...
175
click to vote
EAAI
2006
15 years 6 months ago
2006
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...
180
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
161
click to vote
AINA
2009
IEEE
16 years 1 months ago
2009
IEEE
The two most important aspects of any imagebased steganographic system are the imperceptibility and the capacity of the stego image. This paper evaluates the performance and effic...