Sciweavers

425 search results - page 48 / 85
» Adaptive Network Flow Clustering
Sort
View
IPPS
2007
IEEE
15 years 7 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
DMSN
2006
ACM
15 years 6 months ago
Network scheduling for data archiving applications in sensor networks
Since data archiving in sensor networks is a communication intensive application, a careful power management of communication is of critical importance for such networks. An examp...
Yong Yao, S. M. Nazrul Alam, Johannes Gehrke, Serg...
CONEXT
2010
ACM
14 years 10 months ago
Simple yet efficient, transparent airtime allocation for TCP in wireless mesh networks
In this paper, we explore a simple yet effective technique for explicitly allocating airtime to each active pair of communicating neighbors in a wireless neighborhood so that TCP ...
Ki-Young Jang, Konstantinos Psounis, Ramesh Govind...
127
Voted
CDC
2010
IEEE
126views Control Systems» more  CDC 2010»
14 years 7 months ago
Cooperative control of networked nonlinear systems
In this paper, network-based cooperative control of nonlinear dynamical systems is investigated. A theorem on cooperative stability is presented for designing nonlinear consensus a...
Zhihua Qu
BMCBI
2008
166views more  BMCBI 2008»
15 years 27 days ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...