1047 search results - page 58 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract-- In this paper, we address both lifetime and survivability issues in wireless sensor networks (WSNs). We present an easy-to-implement clustering method called DED (distri...
IR
2006
13 years 7 months ago
2006
Abstract. Peer-to-peer (P2P) networks integrate autonomous computing resources without requiring a central coordinating authority, which makes them a potentially robust and scalabl...
HPCC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Automated online search is a powerful technique for performance diagnosis. Such a search can change the types of experiments it performs while the program is running, mak...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
AE
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...