1199 search results - page 35 / 240 » Parameterized Proof Complexity |
CAV
2007
Springer
14 years 20 days ago
2007
Springer
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
ACID
2006
13 years 10 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
SMI
2010
IEEE
13 years 7 months ago
2010
IEEE
—Volumetric parameterization plays an important role for geometric modeling. Due to the complicated topological nature of volumes, it is much more challenging than the surface ca...
COMPSAC
2007
IEEE
14 years 3 months ago
2007
IEEE
Although many of the software engineering activities can now be model-supported, the model is often missing in software development. We are interested in retrieving statemachine m...
CDC
2009
IEEE
13 years 9 months ago
2009
IEEE
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...