Sciweavers

158 search results - page 30 / 32
» On Complexity of Optimal Recombination for Binary Representa...
Sort
View
IPPS
2006
IEEE
14 years 3 days ago
Compiler assisted dynamic management of registers for network processors
Modern network processors support high levels of parallelism in packet processing by supporting multiple threads that execute on a micro-engine. Threads switch context upon encoun...
R. Collins, Fernando Alegre, Xiaotong Zhuang, Sant...
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
13 years 11 months ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
13 years 11 months ago
CGP visits the Santa Fe trail: effects of heuristics on GP
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
Cezary Z. Janikow, Christopher J. Mann
ICCV
2007
IEEE
14 years 8 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
SAC
2000
ACM
13 years 10 months ago
The Mobile Agent Technology to Support and to Access Museum Information
The global scenario put together by communication networks determines new opportunities towards the realization of Internetbased distributed services in many complex and composite...
Paolo Bellavista, Antonio Corradi, Andrea Tomasi