Sciweavers

427 search results - page 59 / 86
» A Subexponential Bound for Linear Programming
Sort
View
COR
2010
123views more  COR 2010»
13 years 9 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
MP
2008
99views more  MP 2008»
13 years 8 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph
PARA
1995
Springer
14 years 12 days ago
ScaLAPACK Tutorial
Abstract. ScaLAPACK is a library of high performance linear algebra routines for distributed memory MIMD computers. It is a continuation of the LAPACK project, which designed and p...
Jack Dongarra, Antoine Petitet
DBPL
1999
Springer
109views Database» more  DBPL 1999»
14 years 1 months ago
Expressing Topological Connectivity of Spatial Databases
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
Floris Geerts, Bart Kuijpers
ICML
2008
IEEE
14 years 9 months ago
Learning to classify with missing and corrupted features
After a classifier is trained using a machine learning algorithm and put to use in a real world system, it often faces noise which did not appear in the training data. Particularl...
Ofer Dekel, Ohad Shamir