Sciweavers

7092 search results - page 1386 / 1419
» Parallelizing constraint programs
Sort
View
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
13 years 12 months ago
Optimal latch mapping and retiming within a tree
We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming [1,3,4] and extends them to retime pipelined cir...
Joel Grodstein, Eric Lehman, Heather Harkness, Her...
ICC
2007
IEEE
139views Communications» more  ICC 2007»
13 years 11 months ago
Comparison of Protection Mechanisms: Capacity Efficiency and Recovery Time
High efficiency in capacity utilization and fast restoration are two primary goals of survivable design in optical networks. Shared backup path protection has been shown to be effi...
Wensheng He, Arun K. Somani
CODES
2004
IEEE
13 years 11 months ago
Operation tables for scheduling in the presence of incomplete bypassing
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...
BROADNETS
2006
IEEE
13 years 11 months ago
Efficient Integration of Web Services in Ambient-aware Sensor Network Applications
Sensor webs are heterogeneous collections of sensor devices that collect information and interact with the environment. They consist of wireless sensor networks that are ensembles ...
Isaac Amundson, Manish Kushwaha, Xenofon D. Koutso...
CSL
2006
Springer
13 years 11 months ago
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
Lukasz Kaiser
« Prev « First page 1386 / 1419 Last » Next »