4403 search results - page 314 / 881 » Galois Theory of Algorithms |
174
click to vote
TOPLAS
2010
15 years 5 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...
215
click to vote
DMTCS
2010
15 years 4 months ago
2010
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
199
click to vote
IWOCA
2010
Springer
15 years 1 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...
238
click to vote
GECCO
2011
Springer
14 years 10 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)...
240
Voted
SIAMCOMP
2011
15 years 1 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...