2947 search results - page 159 / 590 » Analyzing Program Analyses |
174
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
169
click to vote
SAS
2001
Springer
15 years 10 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
165
click to vote
CIRA
2007
IEEE
15 years 10 months ago
2007
IEEE
This article presents an approach to Programming by Demonstration (PbD) to simplify programming of industrial manipulators. By using a set of task primitives for a known task type,...
141
click to vote
APIN
2010
15 years 6 months ago
2010
Artificial neural networks can be trained to perform excellently in many application areas. While they can learn from raw data to solve sophisticated recognition and analysis prob...
174
click to vote
SIAMJO
2008
15 years 6 months ago
2008
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...