882 search results - page 118 / 177 » Local Search for Very Large SAT Problems |
273
click to vote
OL
2011
14 years 11 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
214
click to vote
Publication
Traffic measurements on a ring local area computer network at the Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival pr...
134
click to vote
EMMCVPR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
177
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...
127
click to vote
AI
1998
Springer
15 years 8 months ago
1998
Springer
During past few years, a variety of methods have been developed for learning probabilistic networks from data, among which the heuristic single link forward or backward searches ar...