Sciweavers

1080 search results - page 128 / 216
» Problem dependent optimization (PDO)
Sort
View
AI
2011
Springer
14 years 11 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
PROMISE
2010
14 years 11 months ago
How effective is Tabu search to configure support vector regression for effort estimation?
Background. Recent studies have shown that Support Vector Regression (SVR) has an interesting potential in the field of effort estimation. However applying SVR requires to careful...
Anna Corazza, Sergio Di Martino, Filomena Ferrucci...
CDC
2009
IEEE
211views Control Systems» more  CDC 2009»
15 years 9 months ago
An event-triggered distributed primal-dual algorithm for Network Utility maximization
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
Pu Wan, Michael D. Lemmon
GLOBECOM
2007
IEEE
15 years 4 months ago
On Static Code Construction for Alternating Multicast and Simultaneous Multicasts
— In this paper, we introduce a network multicast problem called the alternating multicast problem. In this problem, there is more than one multicast on the network, but only one...
Chi Kin Ngai, Shenghao Yang, Raymond W. Yeung
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
15 years 4 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...