706 search results - page 116 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
AAAI
2010
13 years 10 months ago
2010
The results of the latest International Probabilistic Planning Competition (IPPC-2008) indicate that the presence of dead ends, states with no trajectory to the goal, makes MDPs h...
GRID
2008
Springer
13 years 8 months ago
2008
Springer
A myriad of recent activities can be seen towards dynamic workflow composition for processing complex and data intensive problems. Meanwhile, the simultaneous emergence of the gri...
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. D...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
IJRR
2008
13 years 8 months ago
2008
This paper deals with minimum time trajectory optimization along a specified path subject to thermal constraints. We point out here that robots are often integrated in complex rob...