Sciweavers

4229 search results - page 121 / 846
» On the Optimality of Spiral Search
Sort
View
ICNC
2005
Springer
15 years 6 months ago
Harmony Search for Generalized Orienteering Problem: Best Touring in China
In order to overcome the drawbacks of mathematical optimization techniques, soft computing algorithms have been vigorously introduced during the past decade. However, there are sti...
Zong Woo Geem, Chung-Li Tseng, Yongjin Park
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 5 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
IJAIT
2002
81views more  IJAIT 2002»
15 years 1 months ago
Guiding Constructive Search with Statistical Instance-Based Learning
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
Orestis Telelis, Panagiotis Stamatopoulos
CODES
2001
IEEE
15 years 5 months ago
Hybrid global/local search strategies for dynamic voltage scaling in embedded multiprocessors
In this paper, we explore a hybrid global/local search optimization framework for dynamic voltage scaling in embedded multiprocessor systems. The problem is to find, for a multipr...
Neal K. Bambha, Shuvra S. Bhattacharyya, Jürg...
AAAI
2006
15 years 2 months ago
Estimating Search Tree Size
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
Philip Kilby, John K. Slaney, Sylvie Thiéba...