Sciweavers

1146 search results - page 70 / 230
» Finite cupping sets
Sort
View
AIPS
2007
13 years 11 months ago
Mixed Integer Linear Programming for Exact Finite-Horizon Planning in Decentralized Pomdps
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
Raghav Aras, Alain Dutech, François Charpil...
WSC
2007
13 years 11 months ago
Estimating the probability of a rare event over a finite time horizon
We study an approximation for the zero-variance change of measure to estimate the probability of a rare event in a continuous-time Markov chain. The rare event occurs when the cha...
Pieter-Tjerk de Boer, Pierre L'Ecuyer, Gerardo Rub...
CORR
2008
Springer
100views Education» more  CORR 2008»
13 years 9 months ago
Graph-Based Classification of Self-Dual Additive Codes over Finite Fields
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
Lars Eirik Danielsen
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
13 years 9 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie
IJAC
2007
99views more  IJAC 2007»
13 years 9 months ago
Normalized Expressions and Finite Automata
There exist two well-known quotients of the position automaton of a regular expression. The first one, called the equation automaton, has first been introduced by Mirkin from th...
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Zi...