7092 search results - page 601 / 1419 » Parallelizing constraint programs |
169
click to vote
CAIP
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Dynamic Programming (DP) is a popular and efficient method for calculating disparity maps from stereo images. It allows for meeting real-time constraints even on low-cos...
140
Voted
GLOBECOM
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract— For multi-user orthogonal frequency division multiplexing (OFDM) systems, efficient optimal rate and power allocation algorithms are presented via geometric programmin...
168
Voted
ANNPR
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
136
click to vote
IJCAI
2001
15 years 6 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
126
Voted
EOR
2007
15 years 5 months ago
2007
One of the key challenges of current day electronic procurement systems is to enable procurement decisions transcend beyond a single attribute such as cost. Consequently, multiatt...