5316 search results - page 84 / 1064 » Which Search Problems Are Random |
160
click to vote
IJCAI
2003
15 years 2 months ago
2003
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
109
click to vote
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
107
click to vote
CRYPTO
2006
Springer
15 years 4 months ago
2006
Springer
We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the...
112
click to vote
AP2PC
2004
Springer
15 years 6 months ago
2004
Springer
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...