14382 search results - page 262 / 2877 » Time in Connectionist Models |
178
click to vote
TOPNOC
2008
15 years 6 months ago
2008
Recursive Petri Nets (RPNs) allow to design and analyze complex discrete event systems. Indeed, RPNs enable to model patterns of discrete event systems related to the dynamic struc...
202
click to vote
RTSS
2008
IEEE
16 years 28 days ago
2008
IEEE
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
168
click to vote
ISCAS
2006
IEEE
16 years 17 days ago
2006
IEEE
– This paper addresses the problem of ordering and sizing parallel wires in a single metal layer within an interconnect channel of a given width, such that crosscapacitances are ...
163
click to vote
CLUSTER
2003
IEEE
15 years 12 months ago
2003
IEEE
Application run-time information is a fundamental component in application and job scheduling. However, accurate predictions of run times are difficult to achieve for parallel app...
189
click to vote
COOPIS
2002
IEEE
15 years 11 months ago
2002
IEEE
Mobile services offering multi-feature query capabilities must meet tough response time requirements to gain customer acceptance. The top-k query model is a popular candidate to im...