Sciweavers

5624 search results - page 390 / 1125
» On Conditional Covering Problem
Sort
View
ATVA
2010
Springer
175views Hardware» more  ATVA 2010»
15 years 8 months ago
The Complexity of Codiagnosability for Discrete Event and Timed Systems
In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform c...
Franck Cassez
ICML
2010
IEEE
15 years 8 months ago
Multi-Task Learning of Gaussian Graphical Models
We present multi-task structure learning for Gaussian graphical models. We discuss uniqueness and boundedness of the optimal solution of the maximization problem. A block coordina...
Jean Honorio, Dimitris Samaras
SIAMCO
2008
81views more  SIAMCO 2008»
15 years 6 months ago
Connections between Singular Control and Optimal Switching
This paper builds a new theoretical connection between singular control of finite variation and optimal switching problems. This correspondence provides a novel method for solving ...
Xin Guo, Pascal Tomecek
DAM
2002
135views more  DAM 2002»
15 years 6 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
FOSSACS
2012
Springer
14 years 2 months ago
Concurrent Games with Ordered Objectives
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...
Patricia Bouyer, Romain Brenguier, Nicolas Markey,...