3652 search results - page 329 / 731 » A study of query length |
122
Voted
IPL
2008
15 years 3 months ago
2008
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
147
Voted
JCO
2008
15 years 3 months ago
2008
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
112
Voted
TEC
2008
15 years 3 months ago
2008
This paper deals with the optimal computation of finite field exponentiation, which is a well-studied problem with many important applications in the areas of error-correcting code...
120
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
131
Voted
JCO
1998
15 years 3 months ago
1998
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...