Sciweavers

2714 search results - page 432 / 543
» Model comparison with GenericDiff
Sort
View
ESORICS
1994
Springer
15 years 4 months ago
Oblivious Signatures
Abstract. An oblivious signature with n keys (or messages) is a signature that the recipient can choose one of n keys (or messages) to get signed while the signer cannot find out o...
Lidong Chen
SPAA
1994
ACM
15 years 4 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
AUSAI
2007
Springer
15 years 4 months ago
Advances in Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
145
Voted
CASES
2007
ACM
15 years 4 months ago
Compiler generation from structural architecture descriptions
With increasing complexity of modern embedded systems, the availability of highly optimizing compilers becomes more and more important. At the same time, application specific inst...
Florian Brandner, Dietmar Ebner, Andreas Krall
110
Voted
DATE
2009
IEEE
138views Hardware» more  DATE 2009»
15 years 4 months ago
An approximation scheme for energy-efficient scheduling of real-time tasks in heterogeneous multiprocessor systems
As application complexity increases, modern embedded systems have adopted heterogeneous processing elements to enhance the computing capability or to reduce the power consumption. ...
Chuan-Yue Yang, Jian-Jia Chen, Tei-Wei Kuo, Lothar...