5634 search results - page 787 / 1127 » About Abstract Classes |
163
Voted
ACS
2007
15 years 6 months ago
2007
Abstract. For a symmetric monoidal-closed category X and any object K, the category of K-Chu spaces is small-topological over X and small cotopological over Xop . Its full subcateg...
195
click to vote
ACTA
2007
15 years 6 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
186
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
166
click to vote
AUTOMATICA
2007
15 years 6 months ago
2007
In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems ar...
167
click to vote
CONSTRAINTS
2010
15 years 6 months ago
2010
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...