145
click to vote
ALENEX
2016
10 years 1 months ago
2016
We consider the problem of Pareto-optimal route planning in public-transit networks of a whole country, a whole continent, or even the whole world. On such large networks, existin...
242
Voted
ALENEX
2016
10 years 1 months ago
2016
Exploiting geometric structure to improve the asymptotic complexity of discrete assignment problems is a well-studied subject. In contrast, the practical advantages of using geome...
162
Voted
AI
2016
Springer
10 years 1 months ago
2016
Springer
We discuss a new implementation of, and new experiments with, Fajtlowicz’s Dalmatian conjecture-making heuristic. Our program makes conjectures about relations of real number in...
154
Voted
AI
2016
Springer
10 years 1 months ago
2016
Springer
288
Voted
AI
2016
Springer
10 years 1 months ago
2016
Springer
In the Complete Set Partitioning problem we are given a finite set of elements where every subset is associated with a nd the goal is to partition this set into disjoint subsets ...