Sciweavers

283 search results - page 13 / 57
» Deterministic Polynomial Time Algorithms for Matrix Completi...
Sort
View
JAIR
2008
148views more  JAIR 2008»
13 years 7 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang
ADG
1998
Springer
127views Mathematics» more  ADG 1998»
13 years 11 months ago
Decomposing Algebraic Varieties
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
Dongming Wang
PC
2008
123views Management» more  PC 2008»
13 years 7 months ago
The impact of heterogeneity on master-slave scheduling
In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communica...
Jean-Francois Pineau, Yves Robert, Fréd&eac...
DAM
2008
131views more  DAM 2008»
13 years 7 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
SIAMCO
2002
86views more  SIAMCO 2002»
13 years 7 months ago
On the Observability and Detectability of Continuous-Time Markov Jump Linear Systems
The paper introduces a new detectability concept for continuous-time Markov jump linear systems with finite Markov space that generalizes previous concepts found in the literature....
Eduardo F. Costa, João Bosco Ribeiro do Val