13841 search results - page 29 / 2769 » Algorithms and Constraint Programming |
98
Voted
IJCAI
2001
15 years 1 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...
INFORMS
2008
15 years 10 days ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
124
click to vote
CCGRID
2007
IEEE
15 years 4 months ago
2007
IEEE
We describe a hybrid linear programming (LP) and evolutionary algorithm (EA) based resource matcher suitable for heterogeneous grid environments. The hybrid matcher adopts the ite...
144
Voted
JMLR
2012
13 years 2 months ago
2012
Reducing the number of labeled examples required to learn accurate prediction models is an important problem in structured output prediction. In this paper we propose a new transd...
113
Voted
WADS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...