Sciweavers

1478 search results - page 174 / 296
» Modular Complexity Analysis via Relative Complexity
Sort
View
JANCL
2007
115views more  JANCL 2007»
13 years 9 months ago
A logical characterisation of qualitative coalitional games
Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goa...
Paul E. Dunne, Wiebe van der Hoek, Michael Wooldri...
AUTOMATICA
2004
125views more  AUTOMATICA 2004»
13 years 9 months ago
Hamiltonian discretization of boundary control systems
A fundamental problem in the simulation and control of complex physical systems containing distributed-parameter components concerns finite-dimensional approximation. Numerical me...
Goran Golo, Viswanath Talasila, Arjan van der Scha...
JAIR
2000
152views more  JAIR 2000»
13 years 9 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
ECRTS
2009
IEEE
13 years 7 months ago
Approximate Bandwidth Allocation for Compositional Real-Time Systems
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
Nathan Fisher, Farhana Dewan
FM
2009
Springer
154views Formal Methods» more  FM 2009»
13 years 7 months ago
Specification and Verification of Web Applications in Rewriting Logic
Abstract. This paper presents a Rewriting Logic framework that formalizes the interactions between Web servers and Web browsers through icating protocol abstracting HTTP. The propo...
María Alpuente, Demis Ballis, Daniel Romero