2474 search results - page 219 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
332
click to vote
OL
2011
15 years 1 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...
148
click to vote
IPPS
1994
IEEE
15 years 10 months ago
1994
IEEE
Present-day parallel computers often face the problems of large software Overheadsfor process switching and interprocessor communication. These problems are addressed by the Multi...
200
click to vote
ECML
2004
Springer
15 years 10 months ago
2004
Springer
The kernel function plays a central role in kernel methods. Most existing methods can only adapt the kernel parameters or the kernel matrix based on empirical data. Recently, Ong e...
192
click to vote
COR
2007
15 years 6 months ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
164
click to vote
EMMCVPR
2005
Springer
15 years 12 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...