Sciweavers

8413 search results - page 438 / 1683
» Ordering Problem Subgoals
Sort
View
COR
2006
98views more  COR 2006»
15 years 6 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
GRID
2006
Springer
15 years 6 months ago
A QoS-Aware Heuristic Algorithm for Replica Placement
This paper studies the QoS-aware replica placement problem. Although there has been much work on replica placement problem, most of them concerns average system performance and ign...
Hsiangkai Wang, Pangfeng Liu, Jan-Jan Wu
IJRR
2008
151views more  IJRR 2008»
15 years 6 months ago
Trajectory Optimization using Reinforcement Learning for Map Exploration
Automatically building maps from sensor data is a necessary and fundamental skill for mobile robots; as a result, considerable research attention has focused on the technical chall...
Thomas Kollar, Nicholas Roy
IJES
2006
72views more  IJES 2006»
15 years 6 months ago
Non-contiguous linear placement for reconfigurable fabrics
: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabr...
Cristinel Ababei, Kia Bazargan
JMLR
2008
117views more  JMLR 2008»
15 years 6 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer