708 search results - page 27 / 142 » Timing closure: the solution and its problems |
INTERACT
2007
14 years 11 months ago
2007
This paper presents Manas, a Semiotic Engineering epistemic tool for the design of collaborative systems (CoSys) whose aim is to expand the designers’ knowledge and awareness of ...
PLDI
2010
ACM
15 years 7 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
CP
2010
Springer
14 years 8 months ago
2010
Springer
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive d...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
CCO
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...