Sciweavers

333 search results - page 6 / 67
» Query Optimization Using Local Completeness
Sort
View
AAAI
2008
13 years 10 months ago
Anytime Local Search for Distributed Constraint Optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
Roie Zivan
ADBIS
2009
Springer
140views Database» more  ADBIS 2009»
14 years 2 months ago
Optimizing Maintenance of Constraint-Based Database Caches
Abstract. Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarat...
Joachim Klein 0002, Susanne Braun
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
14 years 9 months ago
Query Planning with Limited Source Capabilities
In information-integration systems, sources may have diverse and limited query capabilities. In this paper we show that because sources have restrictions on retrieving their infor...
Chen Li, Edward Y. Chang
PAMI
2007
164views more  PAMI 2007»
13 years 7 months ago
Space-Time Completion of Video
—This paper presents a new framework for the completion of missing information based on local structures. It poses the task of completion as a global optimization problem with a ...
Yonatan Wexler, Eli Shechtman, Michal Irani
SAC
1996
ACM
13 years 11 months ago
A genetic algorithm for the minimum broadcast time problem using a global precedence vector
The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is k...
Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wa...