Sciweavers

371 search results - page 30 / 75
» An anytime algorithm for optimal coalition structure generat...
Sort
View
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
15 years 3 months ago
Optimal latch mapping and retiming within a tree
We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming [1,3,4] and extends them to retime pipelined cir...
Joel Grodstein, Eric Lehman, Heather Harkness, Her...
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 3 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
IMR
2004
Springer
15 years 5 months ago
MSTK - A Flexible Infrastructure Library for Developing Mesh Based Applications
MSTK is a powerful framework for low-level creation and manipulation of unstructured meshes. MSTK is not a mesh generator but it can be used to develop advanced mesh generation so...
Rao V. Garimella
70
Voted
VTC
2006
IEEE
103views Communications» more  VTC 2006»
15 years 5 months ago
Codeword Length Optimization for CPPUWB Systems
— The optimal codeword length that generates the maximum output signal to interference ratio (SIR) for the channel-phase-precoded ultra-wideband (CPPUWB) system proposed in [1] i...
Yu-Hao Chang, Shang-Ho Tsai, Xiaoli Yu, C. C. Jay ...
CPAIOR
2011
Springer
14 years 3 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...