Sciweavers

344 search results - page 36 / 69
» The Santa Claus problem
Sort
View
IJCAI
2001
13 years 11 months ago
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
Alan M. Frisch, Timothy J. Peugniez
ASIACRYPT
2001
Springer
14 years 1 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
CORR
1999
Springer
98views Education» more  CORR 1999»
13 years 9 months ago
A variational description of the ground state structure in random satisfiability problems
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
Giulio Biroli, Rémi Monasson, Martin Weigt
ACL
1996
13 years 11 months ago
Combining Trigram-based and Feature-based Methods for Context-Sensitive Spelling Correction
This paper addresses the problem of correcting spelling errors that result in valid, though unintended words (such as peace and piece, or quiet and quite) and also the problem of ...
Andrew R. Golding, Yves Schabes
JTAER
2007
160views more  JTAER 2007»
13 years 9 months ago
Enabling Knowledge Sharing within e-Government Back-Office Through Ontological Engineering
Nowadays, organizational innovation constitutes the government challenges for providing better and more efficient services to citizens, enterprises or other public offices. E–go...
Graciela Brusa, María Laura Caliusco, Omar ...