Sciweavers

866 search results - page 85 / 174
» On Dynamic Shortest Paths Problems
Sort
View
WWW
2005
ACM
14 years 8 months ago
Focused crawling by exploiting anchor text using decision tree
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
Jun Li, Kazutaka Furuse, Kazunori Yamaguchi
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
14 years 2 months ago
Accelerating Multi-modal Route Planning by Access-Nodes
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...
Daniel Delling, Thomas Pajor, Dorothea Wagner
ICCI
1991
13 years 11 months ago
On the k-Coloring of Intervals
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
Martin C. Carlisle, Errol L. Lloyd
BIOINFORMATICS
2008
119views more  BIOINFORMATICS 2008»
13 years 7 months ago
Optimal design of thermally stable proteins
Motivation: For many biotechnological purposes, it is desirable to redesign proteins to be more structurally and functionally stable at higher temperatures. For example, chemical ...
Ryan M. Bannen, Vanitha Suresh, George N. Phillips...
CDC
2008
IEEE
156views Control Systems» more  CDC 2008»
14 years 2 months ago
On-line, kinodynamic trajectory generation through rectangular channels using path and motion primitives
— We present a motion planning scheme for ground vehicles operating in a partially known environment. Kinematic constraints stemming from vehicle dynamics and from the requiremen...
Efstathios Bakolas, Panagiotis Tsiotras