1478 search results - page 212 / 296 » Modular Complexity Analysis via Relative Complexity |
AIPS
2004
13 years 11 months ago
2004
The problem of optimal policy formulation for teams of resource-limited agents in stochastic environments is composed of two strongly-coupled subproblems: a resource allocation pr...
ENTCS
2007
13 years 10 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
SIGMOD
2011
ACM
13 years 1 months ago
2011
ACM
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
BMCBI
2008
13 years 8 months ago
2008
Background: During the most recent decade many Bayesian statistical models and software for answering questions related to the genetic structure underlying population samples have...