Sciweavers

13841 search results - page 2187 / 2769
» Algorithms and Constraint Programming
Sort
View
SARA
2007
Springer
16 years 1 months ago
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
Ugur Kuter, Jiaqiao Hu
SOFSEM
2007
Springer
16 years 1 months ago
Straightening Drawings of Clustered Hierarchical Graphs
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
Sergey Bereg, Markus Völker, Alexander Wolff,...
UM
2007
Springer
16 years 1 months ago
Capturing User Interests by Both Exploitation and Exploration
Personalization is one of the important research issues in the areas of information retrieval and Web search. Providing personalized services that are tailored toward the specific...
Ka Cheung Sia, Shenghuo Zhu, Yun Chi, Koji Hino, B...
WABI
2007
Springer
16 years 1 months ago
Topology Independent Protein Structural Alignment
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta,...
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
16 years 1 months ago
Landmark Selection for Task-Oriented Navigation
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...
Ronen Lerner, Ehud Rivlin, Ilan Shimshoni
« Prev « First page 2187 / 2769 Last » Next »