140 search results - page 22 / 28 » Orderings and Constraints: Theory and Practice of Proving Te... |
115
Voted
FCT
2003
Springer
15 years 4 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
96
Voted
IOR
2007
14 years 11 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
125
click to vote
MP
2002
14 years 11 months ago
2002
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
96
Voted
LICS
2009
IEEE
15 years 6 months ago
2009
IEEE
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
78
Voted
FMCAD
2009
Springer
15 years 6 months ago
2009
Springer
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...