Sciweavers

1884 search results - page 19 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
CORR
2010
Springer
95views Education» more  CORR 2010»
14 years 10 months ago
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
Frédérique Bassino, Mathilde Bouvel,...
SCA
2007
15 years 9 days ago
A simple boiling module
Recent efforts to visually capture the phenomena of boiling have proposed monolithic approaches that extend the basic techniques underlying existing fluid solvers. In this work, w...
Theodore Kim, Mark Carlson
AI
2007
Springer
15 years 4 months ago
Learning Network Topology from Simple Sensor Data
In this paper, we present an approach for recovering a topological map of the environment using only detection events from a deployed sensor network. Unlike other solutions to this...
Dimitri Marinakis, Philippe Giguère, Gregor...
IPCO
2010
125views Optimization» more  IPCO 2010»
14 years 11 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
ICA
2010
Springer
14 years 8 months ago
Second Order Subspace Analysis and Simple Decompositions
Abstract. The recovery of the mixture of an N-dimensional signal generated by N independent processes is a well studied problem (see e.g. [1,10]) and robust algorithms that solve t...
Harold W. Gutch, Takanori Maehara, Fabian J. Theis