6562 search results - page 139 / 1313 » Noetherianity and Combination Problems |
148
click to vote
IPL
2008
15 years 6 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...
164
click to vote
CEC
2008
IEEE
16 years 17 days ago
2008
IEEE
Abstract— The DNA fragment assembly problem is to reconstruct a DNA chain from multiple fragments that have previously been sequenced in a laboratory. This is a critical step in ...
187
click to vote
CEC
2007
IEEE
16 years 13 days ago
2007
IEEE
— Static resources allocation problems have been widely studied. More recently some of this attention has changed to focus on dynamic problems, where problem specifications, con...
149
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
175
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...