1197 search results - page 87 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
173
Voted
ISQED
2002
IEEE
15 years 10 months ago
2002
IEEE
This paper presents a fast algorithm to optimize both the widths and lengths of power/ground networks under reliability and power dip/ground bounce constraints. The spacesizing wh...
177
click to vote
ICCAD
2009
IEEE
15 years 3 months ago
2009
IEEE
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
219
Voted
CCE
2008
15 years 5 months ago
2008
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
156
Voted
COR
2006
15 years 5 months ago
2006
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...
323
click to vote
ICCSA
2011
Springer
14 years 9 months ago
2011
Springer
This paper describes an ongoing implementation of an open source library dealing with parametric representation of dynamic geometry constructions. We show how some current issues i...