427 search results - page 20 / 86 » A Subexponential Bound for Linear Programming |
119
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
216
click to vote
POPL
2003
ACM
16 years 3 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
143
click to vote
EUROGP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We discuss here empirical comparation between model selection methods based on Linear Genetic Programming. Two statistical methods are compared: model selection based on ...
128
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
131
Voted
LPNMR
2001
Springer
15 years 8 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...