1729 search results - page 318 / 346 » Bound Graph Polysemy |
136
click to vote
CORR
2009
Springer
15 years 2 months ago
2009
Springer
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
164
click to vote
ECRTS
2009
IEEE
15 years 2 months ago
2009
IEEE
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...
228
click to vote
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
139
click to vote
IJRR
2010
15 years 1 months ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
151
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...