2182 search results - page 30 / 437 » A Robust Algorithm for Solving Nonlinear Programming Problem... |
148
click to vote
PPDP
2010
Springer
15 years 2 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
143
click to vote
ICPP
2008
IEEE
15 years 10 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
138
click to vote
PDPTA
1996
15 years 5 months ago
1996
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
112
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
145
click to vote
AI
2001
Springer
15 years 8 months ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...