5608 search results - page 50 / 1122 » On the Theory of Matchgate Computations |
166
click to vote
GECCO
2011
Springer
14 years 5 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
117
click to vote
LPAR
2010
Springer
14 years 11 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
127
click to vote
IWOCA
2010
Springer
14 years 8 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
COMPUTER
2000
15 years 1 months ago
2000
110
click to vote
TOPLAS
2010
14 years 11 months ago
2010
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...