2168 search results - page 228 / 434 » Randomized Algorithms and Complexity Theory |
108
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
135
Voted
ECSQARU
2009
Springer
15 years 10 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
140
click to vote
AAAI
2006
15 years 5 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
126
click to vote
ICAI
2003
15 years 5 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
129
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...