2474 search results - page 392 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
132
Voted
CADE
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
102
click to vote
VLSID
2002
IEEE
16 years 2 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
133
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...
120
click to vote
CPAIOR
2010
Springer
15 years 5 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
126
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...