42230 search results - page 62 / 8446 » Algorithms and Complexity Results for |
139
click to vote
MP
2010
15 years 2 months ago
2010
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
142
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
This paper presents results of the BBOB-2009 benchmarking of 31 search algorithms on 24 noiseless functions in a black-box optimization scenario in continuous domain. The runtime ...
121
click to vote
AAAI
2004
15 years 5 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
121
click to vote
FIMI
2004
15 years 5 months ago
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
142
click to vote
ADG
2006
Springer
15 years 10 months ago
2006
Springer
This paper describes the recent convergence of four topics: polynomial systems, flexibility of three dimensional objects, computational chemistry, and computer algebra. We discuss...