Sciweavers

867 search results - page 46 / 174
» An Evolutionary Algorithm for Integer Programming
Sort
View
TACAS
2010
Springer
146views Algorithms» more  TACAS 2010»
14 years 3 months ago
Ranking Function Synthesis for Bit-Vector Relations
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
Byron Cook, Daniel Kroening, Philipp Rümmer, ...
GECCO
2004
Springer
155views Optimization» more  GECCO 2004»
14 years 2 months ago
Genetic Network Programming with Reinforcement Learning and Its Performance Evaluation
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...
Shingo Mabu, Kotaro Hirasawa, Jinglu Hu
ALDT
2009
Springer
184views Algorithms» more  ALDT 2009»
14 years 1 months ago
Inverse Analysis from a Condorcet Robustness Denotation of Valued Outranking Relations
In this article we develop an indirect approach for assessing criteria significance weights from the robustness of the significance that a decision maker acknowledges for his pai...
Raymond Bisdorff, Patrick Meyer, Thomas Veneziano
ANOR
2006
101views more  ANOR 2006»
13 years 8 months ago
Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks
We consider the routing and wavelength assignment (RWA) in survivable WDM network. A path protection scheme assumed and two different wavelength assignment methods for protection p...
Taehan Lee, Sungsoo Park
INFORMS
2006
87views more  INFORMS 2006»
13 years 8 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...