Sciweavers

2800 search results - page 246 / 560
» Scaling RDF with time
Sort
View
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
16 years 6 days ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...
ASPDAC
2004
ACM
118views Hardware» more  ASPDAC 2004»
16 years 4 days ago
Fast and efficient voltage scheduling by evolutionary slack distribution
- To minimize energy consumption by voltage scaling in design of heterogeneousreal-time embeddedsystems, it is necessary to perfom two distinct tasks: task scheduling (TS) and volt...
Bita Gorjiara, Pai H. Chou, Nader Bagherzadeh, Meh...
DSOM
2004
Springer
16 years 2 days ago
Using Object-Oriented Constraint Satisfaction for Automated Configuration Generation
In this paper, we describe an approach for automatically generating configurations for complex applications. Automated generation of system co nfigurations is required to allow lar...
Tim Hinrichs, Nathaniel Love, Charles J. Petrie, L...
JIT
2004
Springer
166views Database» more  JIT 2004»
16 years 1 days ago
Feature-Oriented Development of Software Product Lines: Mapping Feature Models to the Architecture
Software product lines (PLs) present a solid approach in large scale reuse. Due to the PLs’ inherit complexity, many PL methods use the notion of ”features” to support requir...
Periklis Sochos, Ilka Philippow, Matthias Riebisch
CCGRID
2003
IEEE
16 years 53 min ago
Chameleon: A Resource Scheduler in A Data Grid Environment
Grid computing is moving into two ways. The Computational Grid focuses on reducing execution time of applications that require a great number of computer processing cycles. The Da...
Sang-Min Park, Jai-Hoon Kim