Sciweavers

52 search results - page 1 / 11
» Oblivious Randomized Direct Search for Real-Parameter Optimi...
Sort
View
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
13 years 6 months ago
Oblivious Randomized Direct Search for Real-Parameter Optimization
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
Jens Jägersküpper
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
13 years 11 months ago
Distributed hyper-heuristics for real parameter optimization
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...
Marco Biazzini, Balázs Bánhelyi, Alb...
ANCS
2009
ACM
13 years 2 months ago
Weighted random oblivious routing on torus networks
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
Rohit Sunkam Ramanujam, Bill Lin
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 3 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
ICCD
2008
IEEE
120views Hardware» more  ICCD 2008»
14 years 1 months ago
Near-optimal oblivious routing on three-dimensional mesh networks
— The increasing viability of three dimensional (3D) silicon integration technology has opened new opportunities for chip architecture innovations. One direction is in the extens...
Rohit Sunkam Ramanujam, Bill Lin