Sciweavers

446 search results - page 43 / 90
» Abstract Interpretation Using Typed Decision Graphs
Sort
View
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
13 years 12 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
14 years 1 months ago
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
Pekka Orponen, Satu Elisa Schaeffer
LOGCOM
2007
97views more  LOGCOM 2007»
13 years 7 months ago
Termination for Hybrid Tableaus
Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Bra¨uner [5]. Their paper gives tableau-based decision procedur...
Thomas Bolander, Patrick Blackburn
KELSI
2004
Springer
14 years 29 days ago
Modelling and Prediction of Toxicity of Environmental Pollutants
Abstract. This paper describes the problem of modelling toxicity of environmental pollutants using molecular descriptors from a systems theoretical viewpoint. It is shown that curr...
Frank Lemke, Johann-Adolf Müller, Emilio Benf...
SPIN
2010
Springer
13 years 6 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...