Sciweavers

2950 search results - page 179 / 590
» Computing with Infinitely Many Processes
Sort
View
ICON
2007
IEEE
16 years 19 days ago
A Cache Architecture for Counting Bloom Filters
— Within packet processing systems, lengthy memory accesses greatly reduce performance. To overcome this limitation, network processors utilize many different techniques, e.g., u...
Mahmood Ahmadi, Stephan Wong
RTCSA
2005
IEEE
15 years 12 months ago
Task Partitioning upon Memory-Constrained Multiprocessors
Most prior theoretical research on partitioning algorithms for real-time multiprocessor platforms has focused on ensuring that the cumulative computing requirements of the tasks a...
Nathan Fisher, James H. Anderson, Sanjoy K. Baruah
DAS
2004
Springer
15 years 11 months ago
Results of a Study on Invoice-Reading Systems in Germany
Companies order, receive, and pay for goods. Hence they continually receive and process invoices. For the most part these are printed on paper and are dealt with manually, so that ...
Bertin Klein, Stefan Agne, Andreas Dengel
IMR
2004
Springer
15 years 11 months ago
An Evolvable Meshing Tool Through a Flexible Object-Oriented Design
There are many diverse algorithms for generating a first mesh, refining it and improving it. A tool that allows us to interchange these algorithms according to the requirements ...
M. Cecilia Bastarrica, Nancy Hitschfeld-Kahler
151
Voted
ARITH
2003
IEEE
15 years 11 months ago
A New Iterative Structure for Hardware Division: The Parallel Paths Algorithm
This paper presents a new approach to hardware division—the parallel paths algorithm. In this approach, prescaling allows the division recurrence to be implemented by three proc...
Eric Rice, Richard Hughey