395 search results - page 19 / 79 » Positive Versions of Polynomial Time |
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locat...
ATMOS
2007
14 years 11 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...