Sciweavers

4722 search results - page 173 / 945
» Representation-independent program analysis
Sort
View
LOPSTR
2009
Springer
14 years 3 months ago
The Dependency Triple Framework for Termination of Logic Programs
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
Peter Schneider-Kamp, Jürgen Giesl, Manh Than...
CEC
2005
IEEE
14 years 2 months ago
On improving genetic programming for symbolic regression
This paper reports an improvement to genetic programming (GP) search for the symbolic regression domain, based on an analysis of dissimilarity and mating. GP search is generally di...
Steven Gustafson, Edmund K. Burke, Natalio Krasnog...
ICDAR
2005
IEEE
14 years 2 months ago
A Two-stage Online Handwritten Chinese Character Segmentation Algorithm Based on Dynamic Programming
In this paper, an online handwritten Chinese character segmentation method is proposed. It is based on a dynamic programming algorithm, which uses geometrical features extracted f...
Xue Gao, Pierre Michel Lallican, Christian Viard-G...
LREC
2010
144views Education» more  LREC 2010»
13 years 10 months ago
Inferring Syntactic Rules for Word Alignment through Inductive Logic Programming
This paper presents and evaluates an original approach to automatically align bitexts at the word level. It relies on a syntactic dependency analysis of the source and target text...
Sylwia Ozdowska, Vincent Claveau
MP
2008
91views more  MP 2008»
13 years 9 months ago
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
We analyze the rate of local convergence of the augmented Lagrangian method for nonlinear semidefinite optimization. The presence of the positive semidefinite cone constraint requ...
Defeng Sun, Jie Sun, Liwei Zhang