Sciweavers

1653 search results - page 303 / 331
» Computer science and game theory
Sort
View
AUTOMATICA
1999
122views more  AUTOMATICA 1999»
13 years 8 months ago
Set-valued methods for linear parameter varying systems,
We consider stability analysis and state feedback synthesis for Linear Parameter Varying (LPV) systems. LPV systems are de"ned as linear systems whose dynamics depend on exog...
Jeff S. Shamma, Dapeng Xiong
JAIR
2002
122views more  JAIR 2002»
13 years 8 months ago
Competitive Safety Analysis: Robust Decision-Making in Multi-Agent Systems
Much work in AI deals with the selection of proper actions in a given (known or unknown) environment. However, the way to select a proper action when facing other agents is quite ...
Moshe Tennenholtz
MOBIHOC
2009
ACM
14 years 9 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
ICFP
2005
ACM
14 years 8 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
STACS
2010
Springer
14 years 3 months ago
Evasiveness and the Distribution of Prime Numbers
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
László Babai, Anandam Banerjee, Ragh...