2796 search results - page 64 / 560 » The coolest path problem |
120
click to vote
W2GIS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
103
click to vote
IROS
2009
IEEE
15 years 6 months ago
2009
IEEE
— By combining a low-order model of forecast errors, the extended Kalman filter, and classical continuous optimization, we develop an integrated methodology for planning mobile ...
100
click to vote
CP
2003
Springer
15 years 5 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
100
click to vote
SIAMDM
2010
14 years 10 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
DAM
2007
14 years 11 months ago
2007
Computational methods for inferring haplotype information from genotype data are used in studying the association between genomic variation and medical condition. Recently, Gusfi...