Sciweavers

681 search results - page 49 / 137
» Searching with expectations
Sort
View
MTV
2003
IEEE
126views Hardware» more  MTV 2003»
15 years 5 months ago
Heuristic Backtracking Algorithms for SAT
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of f...
Ateet Bhalla, Inês Lynce, José T. de ...
WIOPT
2006
IEEE
15 years 5 months ago
Optimizing data replication for expanding ring-based queries in wireless sensor networks
We consider the problem of optimizing the number of replicas for event information in wireless sensor networks, when queries are disseminated using expanding rings. We obtain clos...
Bhaskar Krishnamachari, Joon Ahn
INFOSCALE
2006
ACM
15 years 5 months ago
Storage load balancing via local interactions among peers in unstructured P2P networks
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provid...
Kei Ohnishi, Hiroshi Yamamoto, Kento Ichikawa, Mas...
ERCIMDL
2010
Springer
144views Education» more  ERCIMDL 2010»
15 years 27 days ago
Capacity-Constrained Query Formulation
Given a set of keyphrases, we analyze how Web queries with these phrases can be formed that, taken altogether, return a specified number of hits. The use case of this problem is a ...
Matthias Hagen, Benno Stein
TROB
2008
113views more  TROB 2008»
14 years 11 months ago
Occam's Razor Applied to Network Topology Inference
We present a method for inferring the topology of a sensor network given nondiscriminating observations of activity in the monitored region. This is accomplished based on no prior ...
Dimitri Marinakis, Gregory Dudek