Sciweavers

4007 search results - page 622 / 802
» Computation with imprecise probabilities
Sort
View
AIMSA
2004
Springer
15 years 9 months ago
Exploiting the Constrainedness in Constraint Satisfaction Problems
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...
Miguel A. Salido, Federico Barber
APPROX
2004
Springer
100views Algorithms» more  APPROX 2004»
15 years 9 months ago
Estimating the Distance to a Monotone Function
In standard property testing, the task is to distinguish between objects that have a property P and those that are ε-far from P, for some ε > 0. In this setting, it is perfec...
Nir Ailon, Bernard Chazelle, Seshadhri Comandur, D...
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
15 years 9 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
ATAL
2004
Springer
15 years 9 months ago
Product Distribution Theory for Control of Multi-Agent Systems
Product Distribution (PD) theory is a new framework for controlling Multi-Agent Systems (MAS’s). First we review one motivation of PD theory, as the information-theoretic extens...
Chiu Fan Lee, David H. Wolpert
ATAL
2004
Springer
15 years 9 months ago
Fitting and Compilation of Multiagent Models through Piecewise Linear Functions
Decision-theoretic models have become increasingly popular as a basis for solving agent and multiagent problems, due to their ability to quantify the complex uncertainty and prefe...
David V. Pynadath, Stacy Marsella