1197 search results - page 101 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
152
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
The problem of dynamical tomography consists in reconstructing a temporal sequence of images from their noisy projections. For this purpose, a recursive algorithm is usually used,...
155
click to vote
ICPR
2006
IEEE
16 years 6 months ago
2006
IEEE
The recovery of writing trajectory from offline handwritten image is generally regarded as a difficult problem [1]. This paper introduced a method to recover the writing trajector...
144
click to vote
AIPS
2006
15 years 7 months ago
2006
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
160
click to vote
ICRA
2009
IEEE
16 years 10 days ago
2009
IEEE
— In this paper, we propose a method that detects repeated motion patterns in a long motion sequence efficiently. Repeated motion patterns are the structured information that ca...
151
click to vote
ICCAD
2002
IEEE
16 years 2 months ago
2002
IEEE
- This paper addresses the problem of maximizing capacity utilization of the battery power source in a portable electronic system under latency and loss rate constraints. First, a ...