Sciweavers

90 search results - page 3 / 18
» Combining Symbolic Representations for Solving Timed Games
Sort
View
ATAL
2011
Springer
12 years 6 months ago
Concise characteristic function representations in coalitional games based on agent types
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Thus, coalitional games, including Coalition Structure Generation (CSG), have been ...
Suguru Ueda, Makoto Kitaki, Atsushi Iwasaki, Makot...
FORMATS
2006
Springer
13 years 10 months ago
Model Checking Timed Automata with Priorities Using DBM Subtraction
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
Alexandre David, John Håkansson, Kim Guldstr...
ICASSP
2011
IEEE
12 years 10 months ago
Source localization using time difference of arrival within a sparse representation framework
The problem addressed is source localization via time-differenceof-arrival estimation in a multipath channel. Solving this localization problem typically implies cross-correlating...
Ciprian R. Comsa, Alexander M. Haimovich, Stuart C...
IIHMSP
2006
IEEE
136views Multimedia» more  IIHMSP 2006»
14 years 8 days ago
Boosted String Representation and Its Application to Video Surveillance
This paper presents a new behavior classification system for analyzing human movements directly from video sequences. First of all, we propose a triangulation-based method to tran...
Yung-Tai Hsu, Jun-Wei Hsieh
FSTTCS
2008
Springer
13 years 7 months ago
Explicit Muller Games are PTIME
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
Florian Horn