Sciweavers

558 search results - page 56 / 112
» On Graphs in Conceptual Engineering Design
Sort
View
DAC
2009
ACM
14 years 9 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
DAC
2003
ACM
14 years 9 months ago
Partial task assignment of task graphs under heterogeneous resource constraints
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
Radoslaw Szymanek, Krzysztof Kuchcinski
DAC
2006
ACM
14 years 9 months ago
State encoding of large asynchronous controllers
A novel method to solve the state encoding problem in Signal Transition Graphs is presented. It is based on the structural theory of Petri nets and can be applied to large specifi...
Josep Carmona, Jordi Cortadella
CAD
2005
Springer
13 years 8 months ago
Shape-based searching for product lifecycle applications
Estimates suggest that more than 75% of engineering design activity comprises reuse of previous design knowledge to address a new design problem. Reusing design knowledge has grea...
Natraj Iyer, Subramaniam Jayanti, Kuiyang Lou, Yag...
DAC
2006
ACM
14 years 9 months ago
Efficient simulation of critical synchronous dataflow graphs
Simulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dat...
Chia-Jui Hsu, José Luis Pino, Ming-Yung Ko,...