359 search results - page 34 / 72 » The Parameterized Complexity of Counting Problems |
81
Voted
TIP
2008
14 years 10 months ago
2008
Abstract--A snakuscule (a minuscule snake) is the simplest active contour that we were able to design while keeping the quintessence of traditional snakes: an energy term governed ...
IWPC
2010
IEEE
14 years 8 months ago
2010
IEEE
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
AIPS
2006
14 years 11 months ago
2006
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
74
Voted
ICTAI
2005
IEEE
15 years 3 months ago
2005
IEEE
A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and ...
79
Voted
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
— In this article, we investigate a new class of control problems called Ensemble Control, a notion coming from the study of complex spin dynamics in Nuclear Magnetic Resonance (...