128 search results - page 9 / 26 » A Simple Implementation Technique for Priority Search Queues |
154
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
ICCCN
1997
IEEE
15 years 8 months ago
1997
IEEE
We present UDP datagram demultiplexing techniques that can yield potentially substantial applicationindependent performance gains over BSD-derived UDP implementations. Our demulti...
165
click to vote
ADC
2008
Springer
15 years 10 months ago
2008
Springer
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
177
click to vote
MOBISYS
2010
ACM
15 years 6 months ago
2010
ACM
Mobile phones are becoming increasingly sophisticated with a rich set of on-board sensors and ubiquitous wireless connectivity. However, the ability to fully exploit the sensing c...
142
click to vote
JAIR
2011
2011
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
14 years 7 months ago
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...