Sciweavers

703 search results - page 79 / 141
» Using Cases Utility for Heuristic Planning Improvement
Sort
View
CP
2003
Springer
14 years 1 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
ECAI
1998
Springer
14 years 18 hour ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein
AIPS
2007
13 years 10 months ago
Robust Local Search and Its Application to Generating Robust Schedules
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
Hoong Chuin Lau, Thomas Ou, Fei Xiao
VLDB
1999
ACM
148views Database» more  VLDB 1999»
14 years 1 days ago
Loading a Cache with Query Results
Data intensive applications today usually run in either a clientserver or a middleware environment. In either case, they must efficiently handle both database queries, which proc...
Laura M. Haas, Donald Kossmann, Ioana Ursu
JSAC
2007
121views more  JSAC 2007»
13 years 7 months ago
Spare Capacity Allocation in Two-Layer Networks
Abstract— In this paper we consider the problem of provisioning spare capacity in two-layer backbone networks using shared backup path protection. First, two spare capacity alloc...
Yu Liu, David Tipper, K. Vajanapoom