478 search results - page 60 / 96 » Approximation algorithms for general packing problems and th... |
LATIN
2010
Springer
13 years 7 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...
ACL
1997
13 years 10 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...