2430 search results - page 366 / 486 » Computing Tutte Polynomials |
144
click to vote
COCO
2001
Springer
15 years 8 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
151
Voted
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
119
Voted
ICNP
1999
IEEE
15 years 7 months ago
1999
IEEE
In this paper, we propose a receiver-cooperative bandwidth management method for layered multicast streams, considering not only bandwidth requirements but also receivers' pr...
131
Voted
ESOP
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
95
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
A set of synchronization relations between distributed nonatomic events was recently proposed to provide real-time applications with a fine level of discrimination in the specifica...