Sciweavers

4229 search results - page 32 / 846
» On the Optimality of Spiral Search
Sort
View
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
15 years 18 days ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
CEC
2008
IEEE
15 years 5 months ago
A feasibility-preserving local search operator for constrained discrete optimization problems
Abstract— Meta-heuristic optimization approaches are commonly applied to many discrete optimization problems. Many of these optimization approaches are based on a local search op...
Martin Lukasiewycz, Michael Glaß, Christian ...
CEC
2008
IEEE
15 years 5 months ago
Examination of multi-objective optimization method for global search using DIRECT and GA
— A number of multi-objective genetic algorithms (MOGAs) have been developed to obtain Pareto optimal solutions for multi-objective optimization problems. However, as these metho...
Luyi Wang, Hiroyuki Ishida, Tomoyuki Hiroyasu, Mit...
SWAT
2010
Springer
270views Algorithms» more  SWAT 2010»
15 years 4 months ago
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
We present the zipper tree, the first O(log log n)-competitive online binary search tree that performs each access in O(log n) worst-case time. This shows that for binary search ...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
SIAMJO
2002
107views more  SIAMJO 2002»
14 years 10 months ago
A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
We give a pattern search method for nonlinearly constrained optimization that is an adaption of a bound constrained augmented Lagrangian method first proposed by Conn, Gould, and T...
Robert Michael Lewis, Virginia Torczon