5595 search results - page 1028 / 1119 » Approximation Algorithms for Clustering Problems |
171
click to vote
COMGEO
2008
ACM
15 years 5 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
156
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
In Multi-Objective Problems (MOPs) involving uncertainty, each solution might be associated with a cluster of performances in the objective space depending on the possible scenari...
151
click to vote
INFOCOM
2003
IEEE
15 years 10 months ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
158
click to vote
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
147
click to vote
COR
2007
15 years 4 months ago
2007
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...