Sciweavers

2477 search results - page 66 / 496
» Approximate extended formulations
Sort
View
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
14 years 4 months ago
Learning and Approximating the Optimal Strategy to Commit To
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
Joshua Letchford, Vincent Conitzer, Kamesh Munagal...
ICASSP
2008
IEEE
14 years 4 months ago
Identification of linear systems with adaptive control of the cross-multiplicative transfer function approximation
In this paper, we extend the cross-multiplicative transfer function (CMTF) approach for improved system identification in the shorttime Fourier transform (STFT) domain. The propo...
Yekutiel Avargel, Israel Cohen
FMCAD
2004
Springer
14 years 3 months ago
Approximate Symbolic Model Checking for Incomplete Designs
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
Tobias Nopper, Christoph Scholl
MEMOCODE
2003
IEEE
14 years 3 months ago
Real-time Property Preservation in Approximations of Timed Systems
Formal techniques have been widely applied in the design of real-time systems and have significantly helped detect design errors by checking real-time properties of the model. Ho...
Jinfeng Huang, Jeroen Voeten, Marc Geilen
FLOPS
1999
Springer
14 years 2 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer