Sciweavers

1940 search results - page 55 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
AAAI
1996
15 years 7 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
15 years 7 months ago
Understanding elementary landscapes
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
Darrell Whitley, Andrew M. Sutton, Adele E. Howe
AIPS
2009
15 years 7 months ago
Ant Search Strategies For Planning Optimization
In this paper a planning framework based on Ant Colony Optimization techniques is presented. It is well known that finding optimal solutions to planning problems is a very hard co...
Marco Baioletti, Alfredo Milani, Valentina Poggion...
ASC
2007
15 years 6 months ago
Development of a soft computing-based framework for engineering design optimisation with quantitative and qualitative search spa
Most real world engineering design optimisation approaches reported in the literature aim to find the best set of solutions using computationally expensive quantitative (QT ) mode...
Victor Oduguwa, Rajkumar Roy, Didier Farrugia
CORR
2012
Springer
272views Education» more  CORR 2012»
14 years 2 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...