2313 search results - page 187 / 463 » On Heuristic Time Hierarchies |
147
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
170
click to vote
CCGRID
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
148
click to vote
ICRA
2005
IEEE
16 years 4 days ago
2005
IEEE
— Probabilistic sampling-based motion planners are unable to detect when no feasible path exists. A common heuristic is to declare a query infeasible if a path is not found in a ...
173
click to vote
PKDD
2005
Springer
16 years 1 days ago
2005
Springer
Logistic Model Trees have been shown to be very accurate and compact classifiers [8]. Their greatest disadvantage is the computational complexity of inducing the logistic regressi...
186
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...