Sciweavers

48 search results - page 5 / 10
» Path Coupling Using Stopping Times
Sort
View
ICCAD
2004
IEEE
87views Hardware» more  ICCAD 2004»
14 years 5 months ago
Exploiting level sensitive latches in wire pipelining
Wire pipelining emerges as a new necessity for global wires due to increasing wire delay, shrinking clock period and growing chip size. Existing approaches on wire pipelining are ...
V. Seth, Min Zhao, Jiang Hu
IPPS
2000
IEEE
14 years 1 months ago
Take Advantage of the Computing Power of DNA Computers
Ever since Adleman [1] solved the Hamilton Path problem using a combinatorial molecular method, many other hard computational problems have been investigated with the proposed DNA ...
Zhiquan Frank Qiu, Mi Lu
ICDCS
2010
IEEE
13 years 6 months ago
Safe and Stabilizing Distributed Cellular Flows
Advances in wireless vehicular networks present us with opportunities for developing new distributed traffic control algorithms that avoid phenomena such as abrupt phase-transition...
Taylor Johnson, Sayan Mitra, Karthik Manamcheri
HPDC
2005
IEEE
14 years 2 months ago
Genetic algorithm based automatic data partitioning scheme for HPF
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
Sunil Kumar Anand, Y. N. Srikant
ESAW
2006
Springer
14 years 9 days ago
Using Constraints and Process Algebra for Specification of First-Class Agent Interaction Protocols
Abstract. Current approaches to multi-agent interaction involve specifying protocols as sets of possible interactions, and hard-coding decision mechanisms into agent programs in or...
Tim Miller, Peter McBurney