Sciweavers

7129 search results - page 1124 / 1426
» Approximation Algorithms for Treewidth
Sort
View
134
Voted
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 8 months ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 8 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
FPL
2001
Springer
96views Hardware» more  FPL 2001»
15 years 8 months ago
System Level Tools for DSP in FPGAs
Abstract. Visual data ow environments are ideally suited for modeling digital signal processing (DSP) systems, as many DSP algorithms are most naturally speci ed by signal ow gra...
James Hwang, Brent Milne, Nabeel Shirazi, Jeffrey ...
DCC
2000
IEEE
15 years 8 months ago
Arithmetic Coding for Low Power Embedded System Design
We present a novel algorithm that assigns codes to instructions during instruction code compression in order to minimize bus-related bit-toggling and thus reducing power consumpti...
Haris Lekatsas, Wayne Wolf, Jörg Henkel
139
Voted
FOCS
2000
IEEE
15 years 8 months ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber
« Prev « First page 1124 / 1426 Last » Next »