148 search results - page 7 / 30 » Exploiting Parallelism for Hard Problems in Abstract Argumen... |
PPSN
1994
Springer
13 years 11 months ago
1994
Springer
The Reproductive Plan Language 2 (RPL2) is an extensible interpreted language for writing and using evolutionary computing programs. It supports arbitrary genetic representations,...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
OOPSLA
2009
Springer
14 years 2 months ago
2009
Springer
Software has spent the bounty of Moore’s law by solving harder problems and exploiting abstractions, such as highlevel languages, virtual machine technology, binary rewritdynami...
HT
1987
ACM
13 years 11 months ago
1987
ACM
Hypertext is a technology well-suited to exploring different kinds of representational problems. It can be used first as an informal mechanism to describe the attributes of object...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...