1197 search results - page 134 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ISCC
2005
IEEE
14 years 1 months ago
2005
IEEE
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
ISTCS
1993
Springer
14 years 10 days ago
1993
Springer
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
We consider a single-cell multiple-input multiple-output (MIMO) downlink channel where linear transmission and reception strategy is employed. The base station (BS) transmitter is...
JMLR
2006
13 years 8 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
ICASSP
2011
IEEE
12 years 12 months ago
2011
IEEE
We present learning and inference algorithms for a versatile class of partially observed vector autoregressive (VAR) models for multivariate time-series data. VAR models can captu...