Sciweavers

716 search results - page 13 / 144
» Semilinear Program Feasibility
Sort
View
CP
2006
Springer
15 years 1 months ago
Approximability of Integer Programming with Generalised Constraints
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
AMAI
2006
Springer
14 years 9 months ago
Symmetric approximate linear programming for factored MDPs with application to constrained problems
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
Dmitri A. Dolgov, Edmund H. Durfee
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
15 years 3 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
POPL
2010
ACM
15 years 7 months ago
From Program Verification to Program Synthesis
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...
OL
2008
56views more  OL 2008»
14 years 9 months ago
Generalized semi-infinite programming: the Symmetric Reduction Ansatz
We introduce the Symmetric Reduction Ansatz at a point from the closure of the feasible set in generalized semi-infinite programming. A corresponding Symmetric Reduction Lemma is s...
Harald Günzel, Hubertus Th. Jongen, Oliver St...