102291 search results - page 20342 / 20459 » Computability in Computational Geometry |
158
Voted
FM
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
168
click to vote
FOMI
2009
15 years 1 months ago
2009
Abstract. The paper presents the preliminary version of Ontobella - a domain ontology of beliefs. The philosophical assumptions of this system are taken from the philosophy of Roma...
145
Voted
GVD
2009
15 years 1 months ago
2009
Over the last years the means to collect personal data implicitly or explicitly over the Web and by various kinds of sensors and to combine data for profiling individuals has dram...
139
Voted
ICCAD
2009
IEEE
15 years 1 months ago
2009
IEEE
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
118
Voted
ICCAD
2009
IEEE
15 years 1 months ago
2009
IEEE
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...