Sciweavers

8647 search results - page 97 / 1730
» The Container Selection Problem
Sort
View
AAAI
2007
15 years 5 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
4OR
2004
99views more  4OR 2004»
15 years 2 months ago
Upper bounds for revenue maximization in a satellite scheduling problem
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...
Thierry Benoist, Benoît Rottembourg
3DPVT
2006
IEEE
194views Visualization» more  3DPVT 2006»
15 years 9 months ago
Histogram Matching for Camera Pose Neighbor Selection
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....
Kevin L. Steele, Parris K. Egbert, Bryan S. Morse
WMPI
2004
ACM
15 years 8 months ago
Selective main memory compression by identifying program phase changes
During a program’s runtime, the stack and data segments of the main memory often contain much redundancy, which makes them good candidates for compression. Compression and decomp...
Doron Nakar, Shlomo Weiss
126
Voted
GECCO
2010
Springer
189views Optimization» more  GECCO 2010»
15 years 7 months ago
Knowledge mining with genetic programming methods for variable selection in flavor design
This paper presents a novel approach for knowledge mining from a sparse and repeated measures dataset. Genetic programming based symbolic regression is employed to generate multip...
Katya Vladislavleva, Kalyan Veeramachaneni, Matt B...