Sciweavers

93 search results - page 4 / 19
» Fast and Efficient Total Exchange on Two Clusters
Sort
View
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
DAC
2002
ACM
15 years 10 months ago
Dynamic and leakage power reduction in MTCMOS circuits using an automated efficient gate clustering technique
Reducing power dissipation is one of the most principle subjects in VLSI design today. Scaling causes subthreshold leakage currents to become a large component of total power diss...
Mohab Anis, Mohamed Mahmoud, Mohamed I. Elmasry, S...
AAAI
1998
14 years 11 months ago
Fast Transformation of Temporal Plans for Efficient Execution
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
Ioannis Tsamardinos, Nicola Muscettola, Paul H. Mo...
96
Voted
TSMC
2008
189views more  TSMC 2008»
14 years 9 months ago
Automatic Clustering Using an Improved Differential Evolution Algorithm
Differential evolution (DE) has emerged as one of the fast, robust, and efficient global search heuristics of current interest. This paper describes an application of DE to the aut...
Swagatam Das, Ajith Abraham, Amit Konar
COR
2006
96views more  COR 2006»
14 years 9 months ago
Scheduling two parallel machines with a single server: the general case
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan