789 search results - page 49 / 158 » Solving Complex Problems Efficiently with Adaptive Automata |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
AAAI
2006
14 years 11 months ago
2006
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
MICCAI
2010
Springer
14 years 7 months ago
2010
Springer
In this paper, we propose an efficient algorithm for MR image reconstruction. The algorithm minimizes a linear combination of three terms corresponding to a least square data fitti...
109
click to vote
PCM
2005
Springer
15 years 3 months ago
2005
Springer
In general, motion compensated (MC) deinterlacing algorithms can outperform non-MC (NMC) ones. However, we often prefer to choose the latter due to the considerations of error prop...
CONPAR
1992
15 years 1 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...