Sciweavers

3455 search results - page 341 / 691
» Generalized Game Trees
Sort
View
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
15 years 7 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens
COR
2006
98views more  COR 2006»
15 years 6 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
JACM
2006
112views more  JACM 2006»
15 years 6 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
COMBINATORICS
2004
84views more  COMBINATORICS 2004»
15 years 6 months ago
Planar Maps as Labeled Mobiles
We extend Schaeffer's bijection between rooted quadrangulations and welllabeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bi...
J. Bouttier, P. Di Francesco, E. Guitter
TON
2002
94views more  TON 2002»
15 years 6 months ago
Multicast routing and wavelength assignment in multihop optical networks
Abstract--This paper addresses multicast routing in circuitswitched multihop optical networks employing wavelength-division multiplexing. We consider a model in which multicast com...
Ran Libeskind-Hadas, Rami G. Melhem