4926 search results - page 210 / 986 » Two Graph Algorithms On an Associative Computing Model |
192
click to vote
CIIA
2009
15 years 7 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
224
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract— The execution environments For scientific applications have evolved significantly over the years. Vector and parallel architectures have provided significantly faste...
166
click to vote
IWPEC
2009
Springer
16 years 27 days ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
204
click to vote
MOBIHOC
2012
ACM
13 years 8 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
138
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...