1071 search results - page 54 / 215 » Solving Geometric Constraint Systems |
108
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper presents a novel method to increase the accuracy
of linear fitting of implicit polynomials. The proposed
method is based on the 3L algorithm philosophy. The novelty
l...
AIIA
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The O-OSCAR software architecture is a problem solving environment for complex scheduling problem that is based on a constraintbased representation. On top of this core r...
AIPS
2006
14 years 11 months ago
2006
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kep...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— In [5], a version of Relative Map Filter (RMF) is proposed to solve the simultaneous localization and map building (SLAM) problem. In the RMF, the map states contain only quant...
CDC
2009
IEEE
14 years 7 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...