1204 search results - page 87 / 241 » Termination of Polynomial Programs |
117
Voted
ICIC
2009
Springer
15 years 7 months ago
2009
Springer
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
MOR
2002
15 years 10 days ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
91
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
209
Voted
POPL
2008
ACM
16 years 29 days ago
2008
ACM
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
119
click to vote
ISMIS
2000
Springer
15 years 4 months ago
2000
Springer
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...