5473 search results - page 719 / 1095 » On the graph isomorphism problem |
157
click to vote
ATVA
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
183
click to vote
COCOON
2007
Springer
16 years 28 days ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
157
Voted
KES
2007
Springer
16 years 27 days ago
2007
Springer
In spatial graphs with a vast number of nodes, it is difficult to compute a solution to graph optimisation problems. We propose an approach using meta-level agents for multi-agents...
162
click to vote
ICDCS
2006
IEEE
16 years 24 days ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
175
click to vote
INFOCOM
2006
IEEE
16 years 23 days ago
2006
IEEE
— The capacity problem in wireless mesh networks can be alleviated by equipping the mesh routers with multiple radios tuned to non-overlapping channels. However, channel assignme...