Sciweavers

5578 search results - page 1069 / 1116
» Base Class Injection
Sort
View
RTA
2010
Springer
14 years 18 days ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
ACMSE
2006
ACM
14 years 14 days ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
CCGRID
2004
IEEE
14 years 13 days ago
Supporting quality of service in a non-dedicated opportunistic environment
In this paper we investigate the utilization of nondedicated, opportunistic resources in a desktop environment to provide statistical assurances to a class of QoS sensitive, soft ...
Jin Liang, Klara Nahrstedt
CLUSTER
2004
IEEE
14 years 13 days ago
Application-specific scheduling for the organic grid
We propose a biologically inspired and fully-decentralized approach to the organization of computation that is based on the autonomous scheduling of strongly mobile agents on a pe...
Arjav J. Chakravarti, Gerald Baumgartner, Mario La...
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
14 years 13 days ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
« Prev « First page 1069 / 1116 Last » Next »