2168 search results - page 249 / 434 » Randomized Algorithms and Complexity Theory |
130
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
97
Voted
AAAI
2008
15 years 6 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
123
Voted
FTML
2008
15 years 3 months ago
2008
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
157
Voted
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
144
Voted
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...