673 search results - page 82 / 135 » Preference-Based Problem Solving for Constraint Programming |
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorith...
ICCAD
2003
IEEE
14 years 4 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...
ASPDAC
2008
ACM
13 years 9 months ago
2008
ACM
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
IOR
2007
13 years 7 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...