Sciweavers

555 search results - page 72 / 111
» Linear decomposition algorithm for VLSI design applications
Sort
View
TIT
2008
103views more  TIT 2008»
15 years 5 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
ICTAI
1997
IEEE
15 years 9 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...
HYBRID
2010
Springer
16 years 23 days ago
On a control algorithm for time-varying processor availability
We consider an anytime control algorithm for the situation when the processor resource availability is time-varying. The basic idea is to calculate the components of the control i...
Vijay Gupta
JGAA
2008
97views more  JGAA 2008»
15 years 6 months ago
Drawing Bipartite Graphs on Two Parallel Convex Curves
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta
FCCM
2003
IEEE
113views VLSI» more  FCCM 2003»
15 years 11 months ago
Issues and Approaches to Coarse-Grain Reconfigurable Architecture Development
Although domain-specialized FPGAs can offer significant area, speed and power improvements over conventional reconfigurable devices, there are several unique and unexplored design...
Kenneth Eguro, Scott Hauck