Sciweavers

202 search results - page 36 / 41
» Admissible Heuristics for Optimal Planning
Sort
View
DBA
2006
156views Database» more  DBA 2006»
13 years 9 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...
ECCC
2007
99views more  ECCC 2007»
13 years 7 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
14 years 1 months ago
Towards the coevolution of cellular automata controllers for chemical computing with the B-Z reaction
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...
Christopher Stone, Rita Toth, Andrew Adamatzky, Be...
CCGRID
2005
IEEE
14 years 1 months ago
Servicing range queries on multidimensional datasets with partial replicas
Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-org...
Li Weng, Ümit V. Çatalyürek, Tahs...
CP
2003
Springer
14 years 21 days 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