1998 search results - page 274 / 400 » Complexity of the Cover Polynomial |
121
click to vote
FOCS
1999
IEEE
15 years 5 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...
74
Voted
IPPS
1998
IEEE
15 years 5 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...
116
Voted
AGP
1994
IEEE
15 years 4 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
113
click to vote
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
90
Voted
ESORICS
2006
Springer
15 years 4 months ago
2006
Springer
We study the problem of Secure Multi-party Computation (SMC) in a model where individual processes contain a tamper-proof security module, and introduce the TrustedPals framework, ...