Sciweavers

874 search results - page 82 / 175
» Computing Weighted Solutions in Answer Set Programming
Sort
View
85
Voted
DIS
2009
Springer
15 years 7 months ago
Subspace Discovery for Promotion: A Cell Clustering Approach
The promotion analysis problem has been proposed in [16], where ranking-based promotion query processing techniques are studied to effectively and efficiently promote a given obje...
Tianyi Wu, Jiawei Han
105
Voted
EGH
2005
Springer
15 years 6 months ago
Optimal automatic multi-pass shader partitioning by dynamic programming
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
Alan Heirich
115
Voted
GECCO
2009
Springer
113views Optimization» more  GECCO 2009»
15 years 5 months ago
Variable size population for dynamic optimization with genetic programming
A new model of Genetic Programming with variable size population is presented in this paper and applied to the reconstruction of target functions in dynamic environments (i.e. pro...
Leonardo Vanneschi, Giuseppe Cuccu
86
Voted
SAT
2010
Springer
141views Hardware» more  SAT 2010»
15 years 4 months ago
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
Carsten Fuhs, Peter Schneider-Kamp
146
Voted
ILP
2004
Springer
15 years 6 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik