Sciweavers

895 search results - page 28 / 179
» Using graphs for some discrete tomography problems
Sort
View
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 8 months ago
Fault Diagnosis with Dynamic Observers
In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Dynamic observers can switch sensors on or off, thus ...
Franck Cassez, Stavros Tripakis
JALC
2002
97views more  JALC 2002»
13 years 8 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
DM
2007
125views more  DM 2007»
13 years 8 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze
DAC
2003
ACM
14 years 9 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...
EMMCVPR
2009
Springer
14 years 3 months ago
General Search Algorithms for Energy Minimization Problems
We describe a scheme for solving Energy Minimization problems, which is based on the A∗ algorithm accomplished with appropriately chosen LP-relaxations as heuristic functions. Th...
Dmitrij Schlesinger