Sciweavers

1101 search results - page 51 / 221
» heuristics 2007
Sort
View
ICDE
2007
IEEE
164views Database» more  ICDE 2007»
14 years 3 months ago
An Integer Linear Programming Approach to Database Design
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
Stratos Papadomanolakis, Anastassia Ailamaki
EOR
2007
103views more  EOR 2007»
13 years 9 months ago
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
Consider a single machine and a set of   jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
PDPTA
2003
13 years 11 months ago
Queryball: A New Model for Querying in Immersive VR Systems
— In this paper, we propose a powerful and convenient querying model, "Queryball", for users to query in immersive VR systems. In immersive VR systems, users expect int...
Chiemi Watanabe, Ayumi Osugi, Yoshifumi Masunaga, ...
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
13 years 11 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
ANOR
2007
80views more  ANOR 2007»
13 years 9 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...