3838 search results - page 9 / 768 » Techniques for Optimization of Net Algorithms |
EMSOFT
2005
Springer
15 years 3 months ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
103
click to vote
DAC
2000
ACM
15 years 10 months ago
2000
ACM
In this paper, we introduce a new technique for modeling and solving the dynamic power management (DPM) problem for systems with complex behavioral characteristics such as concurr...
DAC
2007
ACM
15 years 10 months ago
2007
ACM
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Verifying the published results of algorithms is part of the usual research process. This helps to both validate the existing literature, but also quite often allows for new insigh...
CP
1998
Springer
15 years 1 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...