Sciweavers

11740 search results - page 358 / 2348
» More Problems in Rewriting
Sort
View
FCCM
2003
IEEE
113views VLSI» more  FCCM 2003»
16 years 22 hour ago
Issues and Approaches to Coarse-Grain Reconfigurable Architecture Development
Although domain-specialized FPGAs can offer significant area, speed and power improvements over conventional reconfigurable devices, there are several unique and unexplored design...
Kenneth Eguro, Scott Hauck
150
Voted
SRDS
2003
IEEE
16 years 4 hour ago
Preventing Orphan Requests in the Context of Replicated Invocation
In today’s systems, applications are composed from various components that may be located on different machines. The components (acting as servers) may have to collaborate in or...
Stefan Pleisch, Arnas Kupsys, André Schiper
AUSAI
2003
Springer
15 years 12 months ago
Guided Operators for a Hyper-Heuristic Genetic Algorithm
We have recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics so as to find...
Limin Han, Graham Kendall
INFOCOM
2002
IEEE
15 years 11 months ago
Exploiting OTDM technology in WDM networks
— Wavelength routed optical networks allow to design a logical topology, comprising lightpaths and routers, which is overlayed on the physical topology, comprising optical fiber...
Marco Mellia, Emilio Leonardi, Marco Feletig, Robe...
ALT
1999
Springer
15 years 11 months ago
On the Uniform Learnability of Approximations to Non-Recursive Functions
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
Frank Stephan, Thomas Zeugmann