Sciweavers

6315 search results - page 275 / 1263
» Approximating Solution Structure
Sort
View
270
Voted
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 7 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
ATAL
2009
Springer
16 years 1 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
ICDE
2007
IEEE
153views Database» more  ICDE 2007»
16 years 29 days ago
An Indexing Structure for Automatic Schema Matching
Querying semantically related data sources depends on the ability to map between their schemas. Unfortunately, in most cases matching between schema is still largely performed man...
Fabien Duchateau, Zohra Bellahsene, Mark Roantree,...
IPPS
2007
IEEE
16 years 29 days ago
iC2mpi: A Platform for Parallel Execution of Graph-Structured Iterative Computations
Parallelization of sequential programs is often daunting because of the substantial development cost involved. Various solutions have been proposed to address this concern, includ...
Harnish Botadra, Qiong Cheng, Sushil K. Prasad, Er...
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
16 years 24 days ago
An analysis of the effects of population structure on scalable multiobjective optimization problems
Multiobjective evolutionary algorithms (MOEA) are an effective tool for solving search and optimization problems containing several incommensurable and possibly conflicting objec...
Michael Kirley, Robert L. Stewart