Sciweavers

9387 search results - page 1626 / 1878
» An Optimal Process Model for a Real Time Process
Sort
View
ICNP
2005
IEEE
15 years 10 months ago
Shape Shifting Tries for Faster IP Route Lookup
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
Haoyu Song, Jonathan S. Turner, John W. Lockwood
ISDA
2005
IEEE
15 years 10 months ago
Managing of Cooperative Genetic Algorithms by Intelligent Agent
Genetic Algorithms (GAs) are very popular optimization tool, although efficient applications of GAs requires users have problem with setting their parameters and used genetic ope...
Halina Kwasnicka, Magdalena Gierusz
ISQED
2005
IEEE
98views Hardware» more  ISQED 2005»
15 years 10 months ago
Wire Planning with Bounded Over-the-Block Wires
Hierarchical approach greatly facilitates large-scale chip design by hiding distracting details in low-level objects. However, the lowlevel designs have to have a global view of h...
Hua Xiang, I-Min Liu, Martin D. F. Wong
IMC
2005
ACM
15 years 10 months ago
Inferring and Debugging Path MTU Discovery Failures
If a host can send packets larger than an Internet path can forward, it relies on the timely delivery of Internet Control Message Protocol (ICMP) messages advising that the packet...
Matthew J. Luckie, Kenjiro Cho, Bill Owens
155
Voted
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
15 years 10 months ago
Backward-chaining genetic programming
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Riccardo Poli, William B. Langdon
« Prev « First page 1626 / 1878 Last » Next »