Sciweavers

299 search results - page 37 / 60
» Dispositional implementation solves the superfluous structur...
Sort
View
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 11 days ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
ECAI
2006
Springer
14 years 5 days ago
A Solver for QBFs in Nonprenex Form
Various problems in AI can be solved by translating them into a quantified boolean formula (QBF) and evaluating the resulting encoding. In this approach, a QBF solver is used as a ...
Uwe Egly, Martina Seidl, Stefan Woltran
CGA
2007
13 years 8 months ago
Interactive Illustrative Rendering on Mobile Devices
Illustrative rendering is a widely used visualization technique to display conceptual information, describe problems and give insight to solve them efficiently in science, engine...
Jingshu Huang, Brian Bue, Avin Pattath, David S. E...
DMIN
2010
262views Data Mining» more  DMIN 2010»
13 years 6 months ago
SMO-Style Algorithms for Learning Using Privileged Information
Recently Vapnik et al. [11, 12, 13] introduced a new learning model, called Learning Using Privileged Information (LUPI). In this model, along with standard training data, the tea...
Dmitry Pechyony, Rauf Izmailov, Akshay Vashist, Vl...
ISSAC
2009
Springer
184views Mathematics» more  ISSAC 2009»
14 years 3 months ago
An iterative method for calculating approximate GCD of univariate polynomials
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
Akira Terui