2796 search results - page 330 / 560 » The coolest path problem |
194
click to vote
CIE
2007
Springer
16 years 22 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
156
click to vote
WAOA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
213
click to vote
SPAA
1999
ACM
15 years 11 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
159
click to vote
TOG
2008
15 years 6 months ago
2008
Modeling the large space of possible human motions requires scalable techniques. Generalizing from example motions or example controllers is one way to provide the required scalab...
157
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...