Sciweavers

1639 search results - page 288 / 328
» Anytime Heuristic Search
Sort
View
DBA
2006
156views Database» more  DBA 2006»
13 years 10 months ago
Simulated Annealing for Materialized View Selection in Data Warehousing Environment
In order to facilitate query processing, the information contained in data warehouses is typically stored as a set of materialized views. Deciding which views to materialize prese...
Roozbeh Derakhshan, Frank K. H. A. Dehne, Othmar K...
AIPS
2003
13 years 10 months ago
The Role of Planning in Grid Computing
Grid computing gives users access to widely distributed networks of computing resources to solve large-scale tasks such as scientific computation. These tasks are defined as stand...
Jim Blythe, Ewa Deelman, Yolanda Gil, Carl Kesselm...
ICAI
2003
13 years 10 months ago
Exploiting the Marginal Profits of Constraints with Evolutionary Multi-Objective Optimization Techniques
Many real-world search and optimization problems naturally involve constraint handling. Recently, quite a few heuristic methods were proposed to solve the nonlinear constrained op...
Zhenyu Yan, Wei Zhi, Lishan Kang
AAAI
1998
13 years 10 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
IJCAI
1989
13 years 9 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic