Sciweavers

3656 search results - page 60 / 732
» Compact Location Problems
Sort
View
TEC
2010
171views more  TEC 2010»
13 years 4 months ago
A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but als...
Shengxiang Yang, Changhe Li
ATVA
2010
Springer
154views Hardware» more  ATVA 2010»
13 years 11 months ago
Lattice-Valued Binary Decision Diagrams
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall,...
EDBT
2002
ACM
132views Database» more  EDBT 2002»
14 years 10 months ago
A Framework for the Physical Design Problem for Data Synopses
Maintaining statistics on multidimensional data distributions is crucial for predicting the run-time and result size of queries and data analysis tasks with acceptable accuracy. To...
Arnd Christian König, Gerhard Weikum
CPE
1998
Springer
80views Hardware» more  CPE 1998»
14 years 2 months ago
Probability, Parallelism and the State Space Exploration Problem
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
William J. Knottenbelt, Mark Mestern, Peter G. Har...
AAAI
2007
14 years 8 days ago
Representative Explanations for Over-Constrained Problems
In many interactive decision making scenarios there is often no solution that satisfies all of the user’s preferences. The decision process can be helped by providing explanati...
Barry O'Sullivan, Alexandre Papadopoulos, Boi Falt...