2333 search results - page 285 / 467 » Recursive Computational Depth |
108
click to vote
FOSSACS
2010
Springer
15 years 9 months ago
2010
Springer
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
100
click to vote
DATE
2009
IEEE
15 years 9 months ago
2009
IEEE
This paper uses under-approximation of unreachable states of a design to derive incomplete specification of combinational logic. The resulting incompletely-specified functions are...
GLOBECOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—We present the optimal relay-subset selection and transmission-time for a decode-and-forward, half-duplex cooperative network of arbitrary size. The resource allocation is obtai...
108
click to vote
IROS
2009
IEEE
15 years 9 months ago
2009
IEEE
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...
DNA
2009
Springer
15 years 8 months ago
2009
Springer
It is well known that the discrete Sierpinski triangle can be defined as the nonzero residues modulo 2 of Pascal’s triangle, and that from this definition one can easily const...