Sciweavers

12289 search results - page 460 / 2458
» computing 2006
Sort
View
COMBINATORICS
2004
97views more  COMBINATORICS 2004»
15 years 6 months ago
Dominance Order and Graphical Partitions
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to ...
Axel Kohnert
IPL
2000
95views more  IPL 2000»
15 years 6 months ago
An efficient upper bound of the rotation distance of binary trees
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
Jean Marcel Pallo
LRE
2002
95views more  LRE 2002»
15 years 6 months ago
A New Computer-assisted Literary Criticism?
If there is such a thing as a new computer-assisted literary criticism, its expression lies in a model that is as broad-based as that presented in John Smith's seminal article...
Raymond G. Siemens
GPEM
2002
134views more  GPEM 2002»
15 years 6 months ago
Genetic Programming and Autoconstructive Evolution with the Push Programming Language
Push is a programming language designed for the expression of evolving programs within an evolutionary computation system. This article describes Push and illustrates some of the o...
Lee Spector, Alan J. Robinson
PPL
2010
118views more  PPL 2010»
15 years 4 months ago
Coping with Decoherence: Parallelizing the Quantum Fourier Transform
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
Marius Nagy, Selim G. Akl