Sciweavers

9842 search results - page 443 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
215
Voted
ISPD
2012
ACM
252views Hardware» more  ISPD 2012»
14 years 3 months ago
Towards layout-friendly high-level synthesis
There are two prominent problems with technology scaling: increasing design complexity and more challenges with interconnect design, including routability. High-level synthesis ha...
Jason Cong, Bin Liu 0006, Guojie Luo, Raghu Prabha...
ISORC
1998
IEEE
15 years 11 months ago
Compositional Specification and Structured Verification of Hybrid Systems in cTLA
Many modern chemical plants have to be modelled as complex hybrid systems consisting of various continuous and event-discrete components. Besides of the modular and easy-to-read s...
Peter Herrmann, Günter Graw, Heiko Krumm
ECAI
2006
Springer
15 years 11 months ago
Learning Behaviors Models for Robot Execution Control
Robust execution of robotic tasks is a difficult problem. In many situations, these tasks involve complex behaviors combining different functionalities (e.g. perception, localizat...
Guillaume Infantes, Félix Ingrand, Malik Gh...
ICSE
2000
IEEE-ACM
15 years 11 months ago
Towards a taxonomy of software connectors
Software systems of today are frequently composed from prefabricated, heterogeneous components that provide complex functionality and engage in complex interactions. Existing rese...
Nikunj R. Mehta, Nenad Medvidovic, Sandeep Phadke
ARTS
1997
Springer
15 years 11 months ago
The Verus Language: Representing Time Efficiently with BDDs
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
Sérgio Vale Aguiar Campos, Edmund M. Clarke