Sciweavers

3433 search results - page 463 / 687
» Heuristics for a bidding problem
Sort
View
SMI
2008
IEEE
107views Image Analysis» more  SMI 2008»
16 years 1 months ago
Approximate topological matching of quadrilateral meshes
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
AINA
2007
IEEE
16 years 1 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
BROADNETS
2007
IEEE
16 years 1 months ago
Monitoring and alarm management in transparent optical networks
—Rapid fault identification and localization in optical networks are crucial due to high data rates. These problems are more challenging than in traditional electronic networks ...
Sava Stanic, Gokhan Sahin, Hongsik Choi, Suresh Su...
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
16 years 25 days ago
A building-block royal road where crossover is provably essential
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
Richard A. Watson, Thomas Jansen
GECCO
2007
Springer
156views Optimization» more  GECCO 2007»
16 years 25 days ago
Techniques for highly multiobjective optimisation: some nondominated points are better than others
The research area of evolutionary multiobjective optimization (EMO) is reaching better understandings of the properties and capabilities of EMO algorithms, and accumulating much e...
David W. Corne, Joshua D. Knowles