Sciweavers

3020 search results - page 295 / 604
» Optimal partition trees
Sort
View
IPSN
2004
Springer
16 years 1 days ago
How to distribute sensors in a random field?
In this paper, we study the optimal way of distributing sensors in a random field to minimize the estimation distortion. We show that this problem is equivalent to certain proble...
Xin Zhang, Stephen B. Wicker
COMCOM
2008
85views more  COMCOM 2008»
15 years 6 months ago
Efficient placement of proxies for hierarchical reliable multicast
The primary focus of this paper is the design of efficient algorithm for the calculation of solution to the placement of proxies for performance optimization in hierarchical relia...
Liansheng Tan, Li Jin, Yi Pan
ATAL
2009
Springer
16 years 1 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
SAT
2007
Springer
118views Hardware» more  SAT 2007»
16 years 24 days ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
ICPADS
2008
IEEE
16 years 1 months ago
Response Time Constrained Top-k Query Evaluation in Sensor Networks
Existing solutions for top-k queries in wireless sensor networks mainly focused on energy efficiency and little attention has been paid to the response time to answer a top-k que...
Weifa Liang, Baichen Chen, Jeffrey Xu Yu