3875 search results - page 137 / 775 » Approximation algorithms for the 0-extension problem |
130
click to vote
ADHOCNOW
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
150
click to vote
AUSAI
2009
Springer
15 years 8 months ago
2009
Springer
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...
140
click to vote
GECCO
2000
Springer
15 years 8 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
134
click to vote
FOCM
2011
14 years 11 months ago
2011
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
196
Voted
PODS
2011
ACM
14 years 7 months ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...