Sciweavers

2109 search results - page 231 / 422
» Solving Necklace Constraint Problems
Sort
View
ATAL
2003
Springer
15 years 11 months ago
Trade of a problem-solving task
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
Shigeo Matsubara
TON
2002
99views more  TON 2002»
15 years 5 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
ECCV
2000
Springer
16 years 8 months ago
Egomotion Estimation Using Quadruples of Collinear Image Points
This paper considers a fundamental problem in visual motion perception, namely the problem of egomotion estimation based on visual input. Many of the existing techniques for solvin...
Manolis I. A. Lourakis
159
Voted
IROS
2007
IEEE
126views Robotics» more  IROS 2007»
16 years 12 days ago
A graph theoretic approach to optimal target tracking for mobile robot teams
Abstract— In this paper, we present an optimization framework for target tracking with mobile robot teams. The target tracking problem is modeled as a generic semidefinite progr...
Jason C. Derenick, John R. Spletzer, M. Ani Hsieh
RTCSA
2006
IEEE
16 years 3 days ago
Maximizing Guaranteed QoS in (m, k)-firm Real-time Systems
(m,k)-firm constraints have been used to schedule tasks in soft/firm real-time systems under overloaded conditions. In general, they are provided by application designers to guara...
Jian (Denny) Lin, Albert M. K. Cheng