7930 search results - page 420 / 1586 » Greedy in Approximation Algorithms |
159
click to vote
COLT
2005
Springer
16 years 11 days ago
2005
Springer
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
167
click to vote
ASPDAC
2004
ACM
16 years 8 days ago
2004
ACM
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
206
click to vote
EVOW
2004
Springer
16 years 6 days ago
2004
Springer
We consider the problem of finding two-dimensional cutting patterns for glass sheets in order to produce rectangular elements requested by customers. The number of needed sheets, ...
152
click to vote
IBERAMIA
2004
Springer
16 years 6 days ago
2004
Springer
In this paper we address the problem of finding an object in a polygonal environment as quickly as possible on average, with a team of mobile robots that can sense the environment...
201
click to vote
ICCS
2004
Springer
16 years 6 days ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...