Sciweavers

2157 search results - page 62 / 432
» Binary ant algorithm
Sort
View
TCS
2008
15 years 8 days ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
ANTS
2000
Springer
87views Algorithms» more  ANTS 2000»
15 years 4 months ago
Reduction in Purely Cubic Function Fields of Unit Rank One
This paper analyzes reduction of fractional ideals in a purely cubic function field of unit rank one. The algorithm is used for generating all the reduced principal fractional ide...
Renate Scheidler
96
Voted
ANTS
2006
Springer
114views Algorithms» more  ANTS 2006»
15 years 4 months ago
The Pseudosquares Prime Sieve
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...
Jonathan Sorenson
ISCAS
2007
IEEE
123views Hardware» more  ISCAS 2007»
15 years 6 months ago
An Organic Computing architecture for visual microprocessors based on Marching Pixels
—The paper presents architecture and synthesis results for an organic computing hardware for smart CMOS camera chips. The organic behavior in the chip hardware is based on distri...
Dietmar Fey, Marcus Komann, Frank Schurz, Andreas ...
96
Voted
CPM
2009
Springer
207views Combinatorics» more  CPM 2009»
15 years 4 months ago
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
Simone Faro, Thierry Lecroq