Sciweavers

213 search results - page 26 / 43
» An Approximation Algorithm for Binary Searching in Trees
Sort
View
NETWORKING
2008
13 years 9 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi
ICML
2008
IEEE
14 years 8 months ago
Sample-based learning and search with permanent and transient memories
We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learni...
David Silver, Martin Müller 0003, Richard S. ...
GECCO
2003
Springer
14 years 27 days ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
PPSN
2004
Springer
14 years 1 months ago
Indicator-Based Selection in Multiobjective Search
Abstract. This paper discusses how preference information of the decision maker can in general be integrated into multiobjective search. The main idea is to first define the opti...
Eckart Zitzler, Simon Künzli
EVOW
2009
Springer
14 years 2 months ago
Evolving Approximate Image Filters
Image filtering involves taking a digital image and producing a new image from it. In software packages such as Adobe’s Photoshop, image filters are used to produce artistic ve...
Simon Colton, Pedro Torres