Sciweavers

281 search results - page 50 / 57
» Code Compaction Using Genetic Algorithms
Sort
View
SPAA
2010
ACM
13 years 7 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
RECOMB
2003
Springer
14 years 7 months ago
Whole-genome comparative annotation and regulatory motif discovery in multiple yeast species
In [13] we reported the genome sequences of S. paradoxus, S. mikatae and S. bayanus and compared these three yeast species to their close relative, S. cerevisiae. Genome-wide comp...
Manolis Kamvysselis, Nick Patterson, Bruce Birren,...
ICCAD
1997
IEEE
126views Hardware» more  ICCAD 1997»
13 years 11 months ago
An output encoding problem and a solution technique
We present a new output encoding problem as follows: Given a specification table, such as a truth table or a finite state machine state table, where some of the outputs are specif...
Subhasish Mitra, LaNae J. Avra, Edward J. McCluske...
TJS
2002
160views more  TJS 2002»
13 years 6 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
ENGL
2007
89views more  ENGL 2007»
13 years 6 months ago
Similarity-based Heterogeneous Neural Networks
This research introduces a general class of functions serving as generalized neuron models to be used in artificial neural networks. They are cast in the common framework of comp...
Lluís A. Belanche Muñoz, Julio Jose ...