2356 search results - page 70 / 472 » Characterizations of postman sets |
173
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
183
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
179
Voted
PLDI
2010
ACM
15 years 10 months ago
2010
ACM
While iterative optimization has become a popular compiler optimization approach, it is based on a premise which has never been truly evaluated: that it is possible to learn the b...
143
click to vote
LATIN
1992
Springer
15 years 10 months ago
1992
Springer
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
123
click to vote
JGT
2006
15 years 6 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...