2412 search results - page 98 / 483 » Which Problems Have Strongly Exponential Complexity |
112
click to vote
COR
2008
15 years 3 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
147
click to vote
TAMC
2009
Springer
15 years 7 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
CG
1998
Springer
15 years 7 months ago
1998
Springer
Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Public...
130
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
222
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...