2681 search results - page 331 / 537 » Problem F |
180
click to vote
ICCAD
2009
IEEE
15 years 4 months ago
2009
IEEE
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
252
click to vote
PKC
2011
Springer
14 years 9 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
169
click to vote
PODC
2005
ACM
16 years 2 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
301
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
158
click to vote
GECCO
2005
Springer
16 years 1 days ago
2005
Springer
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...