592 search results - page 41 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
121
click to vote
AIPS
2007
15 years 5 months ago
2007
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
104
click to vote
CP
2007
Springer
15 years 9 months ago
2007
Springer
The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-w...
129
click to vote
CRV
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
125
click to vote
IFIP12
2004
15 years 4 months ago
2004
The recent deregulation occurred in the public railway sector in many parts of the world has increased the awareness of this sector of the need for quality service that must be oer...
111
click to vote
SIAMJO
2010
14 years 9 months ago
2010
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...