Sciweavers

1304 search results - page 26 / 261
» An Integrated Solver for Optimization Problems
Sort
View
HM
2007
Springer
107views Optimization» more  HM 2007»
15 years 3 months ago
A Memetic Algorithm for the Optimum Communication Spanning Tree Problem
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
Thomas Fischer, Peter Merz
CSCLP
2007
Springer
15 years 3 months ago
Preference-Based Problem Solving for Constraint Programming
Abstract. Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization ...
Ulrich Junker
CP
2008
Springer
14 years 11 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang
COR
2008
88views more  COR 2008»
14 years 9 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
ICCAD
2007
IEEE
130views Hardware» more  ICCAD 2007»
15 years 6 months ago
Modeling, optimization and control of rotary traveling-wave oscillator
Abstract— Rotary traveling-wave oscillator (RTWO) is a recently proposed transmission-line approach for multi-gigahertz rate clock generation. RTWO has the characteristics of bot...
Cheng Zhuo, Huafeng Zhang, Rupak Samanta, Jiang Hu...