Sciweavers

89 search results - page 16 / 18
» Admissibility in Infinite Games
Sort
View
CAV
2006
Springer
128views Hardware» more  CAV 2006»
14 years 15 days ago
Safraless Compositional Synthesis
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, litt...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
ANOR
2002
92views more  ANOR 2002»
13 years 8 months ago
Nash Equilibrium and Subgame Perfection in Observable Queues
A subgame perfection refinement of Nash equilibrium is suggested for games of the following type: each of an infinite number of identical players selects an action using his privat...
Refael Hassin, Moshe Haviv
CLIMA
2010
13 years 10 months ago
Exploring the Boundary of Half Positionality
Half positionality is the property of a language of infinite words to admit positional winning strategies, when interpreted as the goal of a two-player game on a graph. Such proble...
Alessandro Bianco, Marco Faella, Fabio Mogavero, A...
SIAMCO
2002
77views more  SIAMCO 2002»
13 years 8 months ago
Robust Optimal Switching Control for Nonlinear Systems
Abstract. We formulate a robust optimal control problem for a general nonlinear system with finitely many admissible control settings and with costs assigned to switching of contro...
Joseph A. Ball, Jerawan Chudoung, Martin V. Day
TCOM
2010
102views more  TCOM 2010»
13 years 7 months ago
A system performance approach to OSNR optimization in optical networks
Abstract—This paper studies a constrained optical signal-tonoise ratio (OSNR) optimization problem in optical networks from the perspective of system performance. A system optimi...
Yan Pan, Tansu Alpcan, Lacra Pavel