1927 search results - page 370 / 386 » UMDAs for dynamic optimization problems |
197
Voted
SIGMOD
2009
ACM
16 years 20 days ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
110
Voted
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
105
Voted
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
111
Voted
SAIG
2000
Springer
15 years 4 months ago
2000
Springer
Extracting information from data, often also called data analysis, is an important scienti c task. Statistical approaches, which use methods from probability theory and numerical a...
204
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...