14382 search results - page 182 / 2877 » Time in Connectionist Models |
174
click to vote
RTCSA
1999
IEEE
15 years 10 months ago
1999
IEEE
Scheduling in an environment with constraints of many different types is known to be a hard problem. We tackle this problem for an integrated steel plant in Ghent, Belgium, using ...
173
click to vote
DNA
2006
Springer
15 years 10 months ago
2006
Springer
We study the times to grow structures within the tile self-assembly model proposed by Winfree, and the possible shapes that can be achieved. Our earlier work was confined to the g...
556
click to vote
ICA
2012
Springer
14 years 2 months ago
2012
Springer
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...
169
click to vote
IPL
2010
15 years 4 months ago
2010
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
141
click to vote
ICCAD
1992
IEEE
15 years 10 months ago
1992
IEEE
This paper presents a comprehensive timing model for behavioral-level specifications and algorithms for timing analysis in high-level synthesis. It is based on a timing network wh...