7930 search results - page 400 / 1586 » Greedy in Approximation Algorithms |
297
click to vote
ATAL
2005
Springer
16 years 7 days ago
2005
Springer
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
193
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
168
click to vote
OPODIS
2008
15 years 8 months ago
2008
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...
171
click to vote
ESANN
2006
15 years 8 months ago
2006
Abstract. Feature Selection techniques usually follow some search strategy to select a suitable subset from a set of features. Most neural network growing algorithms perform a sear...
180
click to vote
UAI
2003
15 years 8 months ago
2003
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...