Sciweavers

2430 search results - page 198 / 486
» Computing Tutte Polynomials
Sort
View
CDC
2008
IEEE
117views Control Systems» more  CDC 2008»
15 years 11 months ago
Simulation-aided reachability and local gain analysis for nonlinear dynamical systems
Abstract— We analyze reachability properties and local input/output gains of systems with polynomial vector fields. Upper bounds for the reachable set and nonlinear system gains...
Weehong Tan, Ufuk Topcu, Peter Seiler, Gary J. Bal...
LICS
2007
IEEE
15 years 10 months ago
Light Logics and Optimal Reduction: Completeness and Complexity
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
Patrick Baillot, Paolo Coppola, Ugo Dal Lago
CONCUR
2007
Springer
15 years 10 months ago
Strategy Logic
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
Krishnendu Chatterjee, Thomas A. Henzinger, Nir Pi...
WINE
2007
Springer
161views Economy» more  WINE 2007»
15 years 10 months ago
New Algorithms for Approximate Nash Equilibria in Bimatrix Games
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis
CSCLP
2005
Springer
15 years 10 months ago
Among, Common and Disjoint Constraints
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
Christian Bessière, Emmanuel Hebrard, Brahi...