827 search results - page 27 / 166 » The Complexity of Probabilistic Lobbying |
117
Voted
IJCAI
2001
15 years 3 months ago
2001
Deductive, mode-estimation has become an essential component of robotic space systems, like NASA's deep space probes. Future robots will serve as components of large robotic ...
104
Voted
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
100
click to vote
TACAS
2007
Springer
15 years 8 months ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
116
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
104
Voted
AAAI
1998
15 years 3 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...