Sciweavers

581 search results - page 19 / 117
» Component specialization
Sort
View
HPDC
1998
IEEE
13 years 11 months ago
Metascheduling: A Scheduling Model for Metacomputing Systems
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...
Jon B. Weissman
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
13 years 11 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt
ICC
2007
IEEE
14 years 1 months ago
A Support System for Designing Ubiquitous Service Composition Scenarios
—Ubiquitous service composition provides new services and applications seamlessly by establishing cooperation among any devices in home networks and any services in service provi...
Takaaki Moriya, Hiroyuki Ohnishi, Makoto Yoshida, ...
PEPM
1999
ACM
13 years 11 months ago
Declarative Aspect-Oriented Programming
Aspect-oriented programming addresses the problem that the implementation of some properties such as error handling and optimization tends to cross-cut the basic functionality. To...
Ralf Lämmel
COMGEO
2008
ACM
13 years 7 months ago
Encompassing colored planar straight line graphs
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
Ferran Hurtado, Mikio Kano, David Rappaport, Csaba...