269 search results - page 4 / 54 » Optimal Randomized Algorithms for Local Sorting and Set-Maxi... |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
DAC
2009
ACM
14 years 2 months ago
2009
ACM
This paper proposes an equation-based multi-scenario iterative robust optimization methodology for analog/mixed-signal circuits. We show that due to local circuit performance mono...
EUROGRAPHICS
2010
Eurographics
14 years 3 months ago
2010
Eurographics
We present a novel approach to ray tracing execution on commodity graphics hardware using CUDA. We decompose
a standard ray tracing algorithm into several data-parallel stages tha...
CDC
2009
IEEE
14 years 5 days ago
2009
IEEE
Abstract— We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of ...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...