2434 search results - page 248 / 487 » Algorithmic Randomness of Closed Sets |
135
click to vote
ICCD
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
137
click to vote
ICS
2010
Tsinghua U.
15 years 8 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
155
Voted
AAAI
2008
15 years 6 months ago
2008
In multi-robot settings, activity recognition allows a robot to respond intelligently to the other robots in its environment. Conditional random fields are temporal models that ar...
144
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...
140
click to vote
QUESTA
2007
15 years 3 months ago
2007
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, appli...