Sciweavers

14739 search results - page 140 / 2948
» An optimization problem on the sphere
Sort
View
GECCO
2004
Springer
15 years 3 months ago
Controlled Content Crossover: A New Crossover Scheme and Its Application to Optical Network Component Allocation Problem
In this paper, a new genetic mating scheme called Controlled Content Crossover (CCC) is proposed and applied to solve the optical network component allocation problem. In order to ...
Mohammad Amin Dallaali, Malin Premaratne
68
Voted
ICCV
2003
IEEE
15 years 3 months ago
What Does Motion Reveal About Transparency?
The perception of transparent objects from images is known to be a very hard problem in vision. Given a single image, it is difficult to even detect the presence of transparent o...
Moshe Ben-Ezra, Shree K. Nayar
LION
2007
Springer
100views Optimization» more  LION 2007»
15 years 4 months ago
Nested Partitioning for the Minimum Energy Broadcast Problem
The problem of finding the broadcast scheme with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new hybrid algorithm to solve this problem...
Sameh Al-Shihabi, Peter Merz, Steffen Wolf
GECCO
2000
Springer
142views Optimization» more  GECCO 2000»
15 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»
14 years 10 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