Sciweavers

14548 search results - page 196 / 2910
» The Optimal Path-Matching Problem
Sort
View
GECCO
2000
Springer
142views Optimization» more  GECCO 2000»
14 years 2 months ago
Improving EAs for Sequencing Problems
Sequencing problems have to be solved very often in VLSI CAD. To obtain results of high quality, Evolutionary Algorithms (EAs) have been successfully applied in many cases. Howeve...
Wolfgang Günther, Rolf Drechsler
EOR
2008
91views more  EOR 2008»
13 years 11 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini
MP
2008
137views more  MP 2008»
13 years 10 months ago
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
Nilay Noyan, Andrzej Ruszczynski
TIP
2010
113views more  TIP 2010»
13 years 5 months ago
Multiplicative Noise Removal Using Variable Splitting and Constrained Optimization
Multiplicative noise (also known as speckle noise) models are central to the study of coherent imaging systems, such as synthetic aperture radar and sonar, and ultrasound and laser...
José M. Bioucas-Dias, Mário A. T. Fi...
TR
2010
158views Hardware» more  TR 2010»
13 years 5 months ago
Multi-Objective Approaches to Optimal Testing Resource Allocation in Modular Software Systems
Software testing is an important issue in software engineering. As software systems become increasingly large and complex, the problem of how to optimally allocate the limited test...
Zai Wang, Ke Tang, Xin Yao