Sciweavers

1934 search results - page 198 / 387
» Application specific NoC design
Sort
View
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
16 years 6 months ago
Approximation schemes for clustering problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
CISIM
2008
IEEE
16 years 29 days ago
Tuning Struggle Strategy in Genetic Algorithms for Scheduling in Computational Grids
Job Scheduling on Computational Grids is gaining importance due to the need for efficient large-scale Grid-enabled applications. Among different optimization techniques addressed ...
Fatos Xhafa, Bernat Duran, Ajith Abraham, Keshav P...
ADAEUROPE
2006
Springer
16 years 14 days ago
Interchangeable Scheduling Policies in Real-Time Middleware for Distribution
When a middleware layer is designed for providing semi-transparent distribution facilities to real-time applications, a trade-off must be made between the expressiveness and contro...
Juan López Campos, J. Javier Gutiérr...
ARCS
2005
Springer
16 years 1 days ago
An FPGA Dynamically Reconfigurable Framework for Modular Robotics
Dynamic Reconfiguration has always constituted a challenge for embedded systems designers. Nowadays, technological developments make possible to do it on Xilinx FPGAs, but setting...
Andres Upegui, Rico Moeckel, Elmar Dittrich, Auke ...
PCI
2005
Springer
15 years 12 months ago
Scenario Networks: Specifying User Interfaces with Extended Use Cases
In this paper, we present the rationale and the baseline of a notation which can be used on its own or as an extension to standard UML to facilitate specification of an interactive...
Demosthenes Akoumianakis, Ioannis Pachoulakis