874 search results - page 65 / 175 » Computing Weighted Solutions in Answer Set Programming |
108
click to vote
IEEEPACT
1998
IEEE
15 years 5 months ago
1998
IEEE
Conventional speculative architectures use branch prediction to evaluate the most likely execution path during program execution. However, certain branches are difficult to predic...
109
click to vote
ESA
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
112
click to vote
CPAIOR
2006
Springer
15 years 4 months ago
2006
Springer
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
127
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
105
Voted
AUTOMATICA
2007
15 years 27 days ago
2007
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs with a parameter in the cost, or equivalently the right-...