Sciweavers

413 search results - page 48 / 83
» On space constrained set selection problems
Sort
View
AIPS
2000
15 years 1 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
15 years 5 months ago
Configuration of a genetic algorithm for multi-objective optimisation of solar gain to buildings
We report the formulation and implementation of a genetic algorithm to address multi-objective optimisation of solar gain to buildings with the goal of minimising energy consumpti...
Ralph Evins
113
Voted
PVLDB
2008
122views more  PVLDB 2008»
14 years 12 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
85
Voted
AIPS
2006
15 years 1 months ago
Automated Planning Using Quantum Computation
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
Sanjeev Naguleswaran, Langford B. White, I. Fuss
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
15 years 4 months ago
DynaMat: A Dynamic View Management System for Data Warehouses
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
Yannis Kotidis, Nick Roussopoulos