721 search results - page 55 / 145 » Almost universal graphs |
IJCAI
1993
15 years 1 months ago
1993
This paper describes a technique whereby an autonomous agent such as a mobile robot can explore an unknown environment and make a topologicalmapofit. It is assumedthat the environ...
PERCOM
2006
ACM
15 years 11 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
ICCD
2004
IEEE
15 years 8 months ago
2004
IEEE
Formal and dynamic (simulation, emulation, etc.) verification techniques are both needed to deal with the overall challenge of verification. Ideally, the same specification/tes...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Multi-core processors are a shift of paradigm in computer architecture that promises a dramatic increase in performance. But multi-core processors also bring an unprecedented leve...
CSR
2007
Springer
15 years 6 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...