14158 search results - page 273 / 2832 » Generalized switch-setting problems |
112
Voted
FOCS
1997
IEEE
15 years 8 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
144
click to vote
CRYPTO
2008
Springer
15 years 6 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
133
click to vote
AAAI
2000
15 years 5 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
142
click to vote
AAAI
2000
15 years 5 months ago
2000
Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine quadratic penalty problems. There exist other classes of single machine job sequencin...
148
Voted
AUSAI
2003
Springer
15 years 9 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...