14386 search results - page 299 / 2878 » The Chinese Generals Problem |
155
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...
142
Voted
AAAI
2000
15 years 6 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...
150
click to vote
AAAI
2000
15 years 6 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...
149
click to vote
MP
1998
15 years 4 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
138
click to vote
ICSM
2009
IEEE
15 years 2 months ago
2009
IEEE
Field testing of a software application prior to general release is an important and essential quality assurance step. Field testing helps identify unforeseen problems. Extensive ...