592 search results - page 74 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
114
click to vote
ACMSE
2008
ACM
15 years 5 months ago
2008
ACM
With stock surpluses and shortages representing one of the greatest elements of risk to wholesalers, a solution to the multiretailer supply chain management problem would result i...
135
click to vote
COR
2007
15 years 3 months ago
2007
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
125
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
127
click to vote
ISLPED
1996
ACM
15 years 7 months ago
1996
ACM
We present a dynamic programming technique for solving the multiple supply voltage scheduling problem in both nonpipelined and functionally pipelined data-paths. The scheduling pro...
134
click to vote
CVPR
2007
IEEE
15 years 9 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...