Sciweavers

1453 search results - page 48 / 291
» A globally optimal algorithm for TTD-MDPs
Sort
View
KDD
2006
ACM
159views Data Mining» more  KDD 2006»
14 years 8 months ago
Global distance-based segmentation of trajectories
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
Aris Anagnostopoulos, Michail Vlachos, Marios Hadj...
SIAMJO
2010
87views more  SIAMJO 2010»
13 years 6 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
CPAIOR
2007
Springer
14 years 1 months ago
Generalizations of the Global Cardinality Constraint for Hierarchical Resources
Abstract. We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such...
Alessandro Zanarini, Gilles Pesant
PG
2007
IEEE
14 years 2 months ago
Developable Strip Approximation of Parametric Surfaces with Global Error Bounds
Developable surfaces have many desired properties in manufacturing process. Since most existing CAD systems utilize parametric surfaces as the design primitive, there is a great d...
Yong-Jin Liu, Yu-Kun Lai, Shi-Min Hu
AROBOTS
2002
91views more  AROBOTS 2002»
13 years 7 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro