Sciweavers

25167 search results - page 341 / 5034
» Parallel and Distributed Algorithms
Sort
View
182
Voted
IPPS
2002
IEEE
15 years 11 months ago
Concept-Based Component Libraries and Optimizing Compilers
This paper discusses concept lattices and some of their applications in component library development and compiler optimizations. Ongoing work on concept-based userextensible simp...
Sibylle Schupp, D. P. Gregor, B. Osman, David R. M...
IPPS
2000
IEEE
15 years 11 months ago
Quality of Service Negotiation for Distributed, Dynamic Real-Time Systems
Dynamic, distributed, real-time systems control an environment that varies widely without any time-invariant statistical or deterministic characteristic, are spread across multiple...
Charles Cavanaugh, Lonnie R. Welch, Behrooz Shiraz...
160
Voted
IPPS
1999
IEEE
15 years 11 months ago
Lower Bounds on the Loading of Degree-2 Multiple Bus Networks for Binary-Tree Algorithms
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
Hettihe P. Dharmasena, Ramachandran Vaidyanathan
DEBS
2008
ACM
15 years 8 months ago
Relative temporal constraints in the Rete algorithm for complex event detection
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
Karen Walzer, Tino Breddin, Matthias Groch
IPPS
2006
IEEE
16 years 23 days ago
Implementation of a programmable array processor architecture for approximate string matching algorithms on FPGAs
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
Panagiotis D. Michailidis, Konstantinos G. Margari...