Sciweavers

10608 search results - page 2029 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ECUMN
2007
Springer
14 years 3 months ago
Path Computation for Incoming Interface Multipath Routing
— Currently used IP routing protocols calculate and only use a single path between two nodes of a network, or in the best case, only paths with the same cost (with OSPF2 or IS-IS...
Pascal Mérindol, Jean-Jacques Pansiot, St&e...
ESA
2007
Springer
176views Algorithms» more  ESA 2007»
14 years 3 months ago
Arrangements in Geometry: Recent Advances and Challenges
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
Micha Sharir
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
14 years 3 months ago
Coevolution of intelligent agents using cartesian genetic programming
A coevolutionary competitive learning environment for two antagonistic agents is presented. The agents are controlled by a new kind of computational network based on a compartment...
Gul Muhammad Khan, Julian Francis Miller, David M....
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 3 months ago
A destructive evolutionary process: a pilot implementation
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
Joe Sullivan, Conor Ryan
HIPEAC
2007
Springer
14 years 3 months ago
A Throughput-Driven Task Creation and Mapping for Network Processors
Abstract. Network processors are programmable devices that can process packets at a high speed. A network processor is typified by multithreading and heterogeneous multiprocessing...
Lixia Liu, Xiao-Feng Li, Michael K. Chen, Roy Dz-C...
« Prev « First page 2029 / 2122 Last » Next »