Sciweavers

2799 search results - page 22 / 560
» The regenerator location problem
Sort
View
IDEAS
2005
IEEE
142views Database» more  IDEAS 2005»
14 years 2 months ago
Automatically Maintaining Wrappers for Web Sources
A substantial subset of the web data follows some kind of underlying structure. Nevertheless, HTML does not contain any schema or semantic information about the data it represents...
Juan Raposo, Alberto Pan, Manuel Álvarez, J...
AIPS
2006
13 years 10 months ago
Incremental Scheduling to Maximize Quality in a Dynamic Environment
We present techniques for incrementally managing schedules in domains where activities accrue quality as a function of the time and resources allocated to them and the goal is to ...
Anthony Gallagher, Terry L. Zimmerman, Stephen F. ...
FUIN
2010
102views more  FUIN 2010»
13 years 6 months ago
Efficient Plan Adaptation through Replanning Windows and Heuristic Goals
Fast plan adaptation is important in many AI-applications. From a theoretical point of view, in the worst case adapting an existing plan to solve a new problem is no more efficien...
Alfonso Gerevini, Ivan Serina
AI
2009
Springer
14 years 3 months ago
STFLS: A Heuristic Method for Static and Transportation Facility Location Allocation in Large Spatial Datasets
Abstract. This paper solves a static and transportation facility location allocation problem defined as follows: given a set of locations Loc and a set of demand objects D located ...
Wei Gu, Xin Wang, Liqiang Geng
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
13 years 10 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller