10493 search results - page 196 / 2099 » Dynamic Word Problems |
108
Voted
ALGORITHMICA
2006
15 years 2 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
122
click to vote
EOR
2006
15 years 2 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
108
Voted
IPL
2008
15 years 2 months ago
2008
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
112
Voted
SIAMCO
2008
15 years 2 months ago
2008
We consider stochastic impulse control problems where the process is driven by one-dimensional diffusions. Impulse control problems are widely applied to financial engineering and...
133
Voted
SIAMCOMP
2000
15 years 2 months ago
2000
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...