Sciweavers

547 search results - page 5 / 110
» Preference-Based Search for Scheduling
Sort
View
AAAI
2007
15 years 1 months ago
Computing Optimal Subsets
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shi...
CPAIOR
2004
Springer
15 years 4 months ago
Scheduling Abstractions for Local Search
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
Pascal Van Hentenryck, Laurent Michel
SIGECOM
1999
ACM
136views ECommerce» more  SIGECOM 1999»
15 years 3 months ago
Automated strategy searches in an electronic goods market: learning and complex price schedules
Markets for electronic goods provide the possibility of exploring new and more complex pricing schemes, due to the flexibility of information goods and negligible marginal cost. I...
Christopher H. Brooks, Scott A. Fay, Rajarshi Das,...
IJCAI
2003
15 years 4 days ago
Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
Daniel S. Bernstein, Lev Finkelstein, Shlomo Zilbe...
TPDS
2002
80views more  TPDS 2002»
14 years 10 months ago
Analysis of Transposition-Table-Driven Work Scheduling in Distributed Search
This paper discusses a new work-scheduling algorithm for parallel search of single-agent state spaces, called Transposition-Table-Driven Work Scheduling, that places the transposit...
John W. Romein, Henri E. Bal, Jonathan Schaeffer, ...