1469 search results - page 91 / 294 » Discretization of a Continuous Curve |
174
click to vote
COCOS
2003
Springer
15 years 9 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
123
click to vote
AIPS
2008
15 years 6 months ago
2008
When controlling an autonomous system, it is inefficient or sometimes impossible for the human operator to specify detailed commands. Instead, the field of AI autonomy has develop...
124
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We introduce new, efficient algorithms for value iteration with multiple reward functions and continuous state. We also give an algorithm for finding the set of all nondominated a...
150
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
141
Voted
WG
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...