Sciweavers

392 search results - page 31 / 79
» Reversal Complexity Revisited
Sort
View
IAT
2007
IEEE
14 years 1 months ago
Revisiting ADOPT-ing and its Feedback Schemes
Here we revisit ADOPT-ing and bring two new contributions. One contribution consists of developing variations on the algorithms keeping the improvement in length of chain of causa...
Marius-Calin Silaghi, Makoto Yokoo
GLVLSI
2010
IEEE
168views VLSI» more  GLVLSI 2010»
13 years 7 months ago
A revisit to voltage partitioning problem
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
Tao Lin, Sheqin Dong, Bei Yu, Song Chen, Satoshi G...
ICLP
2009
Springer
14 years 8 months ago
Modular Nonmonotonic Logic Programming Revisited
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolving virtual creatures revisited
Thirteen years have passed since Karl Sims published his work on evolving virtual creatures. Since then, several novel approaches to neural network evolution and genetic algorithm...
Peter Krcah
EUROCRYPT
2004
Springer
14 years 28 days ago
Dining Cryptographers Revisited
Abstract. Dining cryptographers networks (or DC-nets) are a privacypreserving primitive devised by Chaum for anonymous message publication. A very attractive feature of the basic D...
Philippe Golle, Ari Juels