Sciweavers

266 search results - page 37 / 54
» Linear Recursion
Sort
View
ATAL
2006
Springer
15 years 3 months ago
A technique for reducing normal-form games to compute a Nash equilibrium
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
Vincent Conitzer, Tuomas Sandholm
FORMATS
2008
Springer
15 years 1 months ago
Some Recent Results in Metric Temporal Logic
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model c...
Joël Ouaknine, James Worrell
EOR
2006
65views more  EOR 2006»
14 years 12 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini
COMPUTING
2004
143views more  COMPUTING 2004»
14 years 11 months ago
Biorthogonal Loop-Subdivision Wavelets
We present a biorthogonal wavelet construction for Loop subdivision, based on the lifting scheme. Our wavelet transform uses scaling functions that are recursively defined by Loop...
Martin Bertram
LICS
2010
IEEE
14 years 9 months ago
A Sound and Complete Calculus for Finite Stream Circuits
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
Stefan Milius