719 search results - page 35 / 144 » Solving Sparse Linear Constraints |
166
click to vote
EMNLP
2006
15 years 4 months ago
2006
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...
136
Voted
IAT
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
140
Voted
KDD
2001
ACM
16 years 3 months ago
2001
ACM
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
129
click to vote
FOCS
1990
IEEE
15 years 7 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
120
Voted
JCP
2008
15 years 3 months ago
2008
-In this paper a nonlinear programming approach is used for the minimization of total communication cost to determine the optimum room dimensions for each room. The nonlinear progr...