1299 search results - page 20 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
108
click to vote
CONCUR
1991
Springer
15 years 5 months ago
1991
Springer
This paper deals with verification methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to effi...
169
click to vote
SENSYS
2006
ACM
15 years 7 months ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
123
click to vote
RECOMB
2010
Springer
15 years 9 days ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
103
click to vote
AAAI
2007
15 years 4 months ago
2007
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
JCB
2008
15 years 1 months ago
2008
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock out sets of reactions required to block a given behaviour....