1291 search results - page 80 / 259 » Arithmetic program paths |
MFCS
2009
Springer
14 years 4 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
ESA
2005
Springer
14 years 3 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
ICNP
2002
IEEE
14 years 2 months ago
2002
IEEE
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
TON
1998
13 years 9 months ago
1998
Abstract—The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long...
CAPTECH
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. This paper presents a new technique for computing collisionfree navigation motions from task-level commands for animated human characters in interactive virtual environme...