Sciweavers

9949 search results - page 260 / 1990
» On the Network Complexity of Selection
Sort
View
PLDI
1998
ACM
15 years 10 months ago
Optimizing Direct-threaded Code by Selective Inlining
Achieving good performance in bytecoded language interpreters is di cult without sacri cing both simplicity and portability. This is due to the complexity of dynamic translation (...
Ian Piumarta, Fabio Riccardi
EUSFLAT
2007
126views Fuzzy Logic» more  EUSFLAT 2007»
15 years 8 months ago
Selecting the Optimal Rule Set Using a Bacterial Evolutionary Algorithm
In many regression learning algorithms for fuzzy rule bases it is not possible to define the error measure to be optimized freely. A possible alternative is the usage of global o...
Mario Drobics, János Botzheim, Klaus-Peter ...
CIDR
2003
134views Algorithms» more  CIDR 2003»
15 years 8 months ago
Approximate Range Selection Queries in Peer-to-Peer Systems
We present an architecture for a data sharing peer-to-peer system where the data is shared in the form of database relations. In general, peer-to-peer systems try to locate exactm...
Abhishek Gupta, Divyakant Agrawal, Amr El Abbadi
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 6 months ago
Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
Uwe Aickelin, Kathryn A. Dowsland
TVLSI
2002
98views more  TVLSI 2002»
15 years 6 months ago
Minimizing memory access energy in embedded systems by selective instruction compression
We propose a technique for reducing the energy spent in the memory-processor interface of an embedded system during the execution of firmware code. The method is based on the idea ...
Luca Benini, Alberto Macii, Enrico Macii, Massimo ...