1236 search results - page 184 / 248 » Prefix-Like Complexities and Computability in the Limit |
105
click to vote
GLOBECOM
2008
IEEE
14 years 10 months ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
CN
2006
14 years 10 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
BC
2004
14 years 9 months ago
2004
Flies have the capability to visually track small moving targets, even across cluttered backgrounds. Previous computational models, based on figure detection (FD) cells identified ...
130
click to vote
CPE
1994
Springer
15 years 1 months ago
1994
Springer
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
156
click to vote
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...