989 search results - page 30 / 198 » Pebbling and Proofs of Work |
ICASSP
2011
IEEE
13 years 1 days ago
2011
IEEE
This work focuses on the convergence analysis of adaptive distributed beamforming schemes that can be reformulated as local random search algorithms via a random search framework....
ICDT
2010
ACM
14 years 13 days ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
LATA
2010
Springer
14 years 13 days ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
CIE
2005
Springer
14 years 1 months ago
2005
Springer
L APPROACH TO ABSTRACT ALGEBRA THIERRY COQUAND AND HENRI LOMBARDI Recent work in constructive mathematics show that Hilbert’s program works rge part of abstract algebra. Using in...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...