Sciweavers

2738 search results - page 178 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 11 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 11 months ago
Insight knowledge in search based software testing
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...
Andrea Arcuri
CDC
2008
IEEE
15 years 11 months ago
Simultaneous placement and assignment for exploration in mobile backbone networks
Abstract— This paper presents new algorithms for conducting cooperative sensing using a mobile backbone network. This hierarchical sensing approach combines backbone nodes, which...
Emily M. Craparo, Jonathan P. How, Eytan Modiano
INFOCOM
2008
IEEE
15 years 11 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
SECON
2008
IEEE
15 years 11 months ago
Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...