Sciweavers

418 search results - page 40 / 84
» Query Optimization by Simulated Annealing
Sort
View
GECCO
2003
Springer
115views Optimization» more  GECCO 2003»
14 years 1 months ago
The General Yard Allocation Problem
The General Yard Allocation Problem (GYAP) is a resource allocation problem faced by the Port of Singapore Authority. Here, space allocation for cargo is minimized for all incoming...
Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues
EVOW
2009
Springer
14 years 19 days ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
IPPS
2000
IEEE
14 years 12 days ago
Heuristic Solutions for a Mapping Problem in a TV-Anytime Server Network
This paper presents a novel broadband multimedia service called TV-Anytime. The basic idea of this service is to store broadcast media assets onto media server systems and allow c...
Xiaobo Zhou, Reinhard Lüling, Li Xie
EC
2007
167views ECommerce» more  EC 2007»
13 years 8 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
IGARSS
2009
13 years 5 months ago
Optimum Sampling Scheme for Characterization of Mine Tailings
The paper describes a novice method for sampling geochemicals to characterize mine tailings. We model the spatial relationships between a multi-element signature and, as covariate...
Pravesh Debba, Emmanuel John M. Carranza, Alfred S...