1204 search results - page 88 / 241 » Termination of Polynomial Programs |
70
Voted
COLING
2010
14 years 7 months ago
2010
This paper proposes an efficient online method that trains a classifier with many conjunctive features. We employ kernel computation called kernel slicing, which explicitly consid...
85
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
We describe a method for generating accurate, compact, human understandable text classifiers. Text datasets are indexed using Apache Lucene and Genetic Programs are used to constr...
103
Voted
SAS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
110
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Cooperative coevolution has proven to be a promising technique for solving complex combinatorial optimization problems. In this paper, we present four different strategies which i...
93
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...