591 search results - page 85 / 119 » A constraint programming approach to cutset problems |
111
click to vote
JMLR
2012
13 years 9 days ago
2012
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
IFM
2009
Springer
15 years 4 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
81
Voted
ICCAD
2002
IEEE
15 years 6 months ago
2002
IEEE
- This paper addresses the problem of maximizing capacity utilization of the battery power source in a portable electronic system under latency and loss rate constraints. First, a ...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
IOR
2007
14 years 9 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...