478 search results - page 55 / 96 » Approximation algorithms for general packing problems and th... |
KDD
2009
ACM
14 years 3 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
ICTAI
2009
IEEE
14 years 3 months ago
2009
IEEE
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...
ICCAD
2006
IEEE
14 years 5 months ago
2006
IEEE
The wire length estimation is the bottleneck of packing based block placers. To cope with this problem, we present a fast wire length estimation method in this paper. The key idea...
IPSN
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
MP
2006
13 years 8 months ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...