708 search results - page 8 / 142 » Timing closure: the solution and its problems |
AAAI
1996
14 years 11 months ago
1996
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. ...
125
click to vote
EMO
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
TCS
1998
14 years 9 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract— We prove that a controllable set of smooth trajectories is the solution set of a constant coefficient linear differential equation if and only if it is linear, time in...
TABLEAUX
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents the planning system Pdk (Planning with Domain Knowledge), based on the translation of planning problems into Linear Time Logic theories, in such a way that fin...