Sciweavers

14739 search results - page 245 / 2948
» An optimization problem on the sphere
Sort
View
IRREGULAR
1995
Springer
15 years 2 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...
ENDM
2010
100views more  ENDM 2010»
14 years 11 months ago
Large-scale multi-period precedence constrained knapsack problem: A mining application
We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...
Eduardo Moreno, Daniel G. Espinoza, Marcos Goycool...
CORR
2007
Springer
120views Education» more  CORR 2007»
14 years 11 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová
85
Voted
JGO
2008
90views more  JGO 2008»
14 years 11 months ago
A scaling algorithm for polynomial constraint satisfaction problems
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
Ferenc Domes, Arnold Neumaier
CDC
2008
IEEE
121views Control Systems» more  CDC 2008»
15 years 5 months ago
Convex relaxations for quadratic distance problems
This paper deals with convex relaxations for quadratic distance problems, a class of optimization problems relevant to several important topics in the analysis and synthesis of ro...
Andrea Garulli, Alfio Masi, Antonio Vicino