2095 search results - page 87 / 419 » Improved pebbling bounds |
95
Voted
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
112
click to vote
ATAL
2004
Springer
15 years 4 months ago
2004
Springer
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multiagent system...
109
click to vote
ISSTA
2010
ACM
15 years 2 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
128
click to vote
IJCAI
2003
15 years 2 months ago
2003
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
96
Voted
TMC
2010
14 years 11 months ago
2010
—Network coding is an attracting technology that has been shown to be able to improve the throughput of wireless networks. However, there still lacks fundamental understanding on...