5180 search results - page 803 / 1036 » Concurrency, Time, and Constraints |
198
click to vote
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
188
click to vote
ISPD
2000
ACM
15 years 11 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
150
click to vote
ISPD
1999
ACM
15 years 11 months ago
1999
ACM
We study alternatives to FM-based partitioning in the context of end-case processing for top-down standard-cell placement. The primary motivation is that small partitioning instan...
182
click to vote
ICDCS
1999
IEEE
15 years 11 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
166
click to vote
TIME
1994
IEEE
15 years 10 months ago
1994
IEEE
: In a dynamic, multi-agent environment, an the intelligent agents act as automated pilots automated intelligent agent is often faced with the for the simulated aircraft. These aut...