Sciweavers

1171 search results - page 112 / 235
» Variable neighborhood search
Sort
View
ECAI
2004
Springer
14 years 3 months ago
Postponing Branching Decisions
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...
Willem Jan van Hoeve, Michela Milano
KIVS
1999
Springer
14 years 2 months ago
Strategies for Minimizing the Average Cost of Paging on the Air Interface
: Location Management of mobile users in a cellular network covers tracking and paging (searching) functionality. In this paper a sequential search strategy is proposed which reduc...
Dogan Kesdogan, Andrei Trofimov, Dirk Trossen
COCOA
2010
Springer
13 years 8 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
CEC
2008
IEEE
14 years 4 months ago
Solving large scale global optimization using improved Particle Swarm Optimizer
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...
Sheng-Ta Hsieh, Tsung-Ying Sun, Chan-Cheng Liu, Sh...
ASPDAC
1999
ACM
101views Hardware» more  ASPDAC 1999»
14 years 2 months ago
Fast Boolean Matching Under Permutation Using Representative
—This paper presents an efficient method to check the equivalence of two Boolean functions under permutation of the variables. The problem is also known as Boolean matching. As ...
Debatosh Debnath, Tsutomu Sasao