1480 search results - page 232 / 296 » Ants can solve constraint satisfaction problems |
105
click to vote
CEC
2009
IEEE
15 years 6 months ago
2009
IEEE
— By dividing the multiobjective optimization of the decision space into several small regions, this paper proposes multi-objective optimization algorithm based on sub-regional s...
106
click to vote
EMSOFT
2004
Springer
15 years 5 months ago
2004
Springer
Basic retiming is an algorithm originally developed for hardware optimization. Software pipelining is a technique proposed to increase instruction-level parallelism for parallel p...
ICPR
2000
IEEE
15 years 3 months ago
2000
IEEE
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
In this paper we propose an algorithm to estimate missing
values in tensors of visual data. The values can be missing
due to problems in the acquisition process, or because
the ...
87
Voted
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— In this paper we present a dual-based decomposition method, called here the proximal center method, to solve distributed model predictive control (MPC) problems for cou...