2796 search results - page 298 / 560 » The coolest path problem |
177
click to vote
WINET
2010
15 years 5 months ago
2010
One way to reduce energy consumption in wireless sensor networks is to reduce the number of packets being transmitted in the network. As sensor networks are usually deployed with a...
178
click to vote
ANCS
2009
ACM
15 years 4 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
238
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Real-world, multiple-typed objects are often interconnected, forming heterogeneous information networks. A major challenge for link-based clustering in such networks is its potent...
207
click to vote
PODC
2006
ACM
16 years 17 days ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
174
click to vote
MCU
2004
15 years 8 months ago
2004
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...