Sciweavers

2635 search results - page 17 / 527
» Computing multihomogeneous resultants using straight-line pr...
Sort
View
UM
2009
Springer
14 years 4 months ago
Adaptive Clustering of Search Results
Clustering of search results has been shown to be advantageous over the simple list presentation of search results. However, in most clustering interfaces, the clusters are not ada...
Xuehua Shen, ChengXiang Zhai, Nicholas J. Belkin
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
14 years 2 months ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster
GI
2009
Springer
13 years 7 months ago
Towards a Parallel Search for Solutions of Non-deterministic Computations
: In this paper we explore the possibilities to perform the search for results of non-deterministic computations in parallel. We present three different approaches to this problem:...
Fabian Reck, Sebastian Fischer
AIEDAM
2008
102views more  AIEDAM 2008»
13 years 10 months ago
Machine invention of quantum computing circuits by means of genetic programming
We demonstrate the use of genetic programming in the automatic invention of quantum computing circuits that solve problems of potential theoretical and practical significance. We ...
Lee Spector, Jon Klein
POPL
1996
ACM
14 years 2 months ago
Discovering Auxiliary Information for Incremental Computation
This paper presents program analyses and transformations that discover a general class of auxiliary information for any incremental computation problem. Combining these techniques...
Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum