Sciweavers

4679 search results - page 814 / 936
» Modeling When Connections Are the Problem
Sort
View
SASO
2009
IEEE
15 years 4 months ago
Optimising Sensor Layouts for Direct Measurement of Discrete Variables
An optimal sensor layout is attained when a limited number of sensors are placed in an area such that the cost of the placement is minimised while the value of the obtained inform...
X. Rosalind Wang, George Mathews, Don Price, Mikha...
INFOCOM
2009
IEEE
15 years 4 months ago
Distributed Power Allocation Algorithm for Spectrum Sharing Cognitive Radio Networks with QoS Guarantee
—In this paper we study the distributed multi-channel power allocation for spectrum sharing cognitive radio networks with QoS guarantee. We formulate this problem as a noncoopera...
Yuan Wu, Danny H. K. Tsang
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
15 years 4 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen
ATAL
2009
Springer
15 years 4 months ago
Self-organising agent organisations
Self-organising multi-agent systems provide a suitable paradigm for developing autonomic computing systems that manage themselves. Towards this goal, we demonstrate a robust, dece...
Ramachandra Kota, Nicholas Gibbins, Nicholas R. Je...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 4 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...