8512 search results - page 1669 / 1703 » Computing Theory With Relevance |
128
click to vote
COCO
2006
Springer
15 years 6 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
123
click to vote
CSL
2006
Springer
15 years 6 months ago
2006
Springer
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...
130
click to vote
EMSOFT
2006
Springer
15 years 6 months ago
2006
Springer
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...
151
click to vote
ATAL
2003
Springer
15 years 6 months ago
2003
Springer
We develop a new false-name-proof double auction protocol called the Generalized Threshold Price Double auction (GTPD) protocol. False-name-proofness generalizes strategyproofness...
120
click to vote
ISER
1995
Springer
15 years 6 months ago
1995
Springer
Minimalism pursues the following agenda: For a given robotics task, nd the minimal con guration of resources required to solve the task. Thus, minimalism attempts to reduce the re...