408 search results - page 72 / 82 » A lookahead strategy for solving large planning problems |
103
click to vote
GLOBECOM
2008
IEEE
14 years 9 months ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
IJAHUC
2007
14 years 9 months ago
2007
: In wireless sensor networks, one of the main design challenges is to save severely constrained energy resources and obtain a long system lifetime. Low cost of sensors enables us ...
87
Voted
WWW
2006
ACM
15 years 10 months ago
2006
ACM
Ontologies are at the heart of the semantic web. They define the concepts and relationships that make global interoperability possible. However, as these ontologies grow in size t...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
WCNC
2010
IEEE
15 years 1 months ago
2010
IEEE
—When shortest path routing is employed in large scale multi-hop wireless networks, nodes located near the center of the network have to perform disproportional amount of relayin...