Sciweavers

3946 search results - page 554 / 790
» The computational complexity of choice sets
Sort
View
EUROPKI
2004
Springer
16 years 2 days ago
On the Use of Weber Polynomials in Elliptic Curve Cryptography
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...
HIPC
2004
Springer
16 years 1 days ago
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
K. Subramani, Kiran Yellajyosula
142
Voted
ICRA
2003
IEEE
118views Robotics» more  ICRA 2003»
15 years 12 months ago
Capturing a convex object with three discs
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
Jeff Erickson, Shripad Thite, Fred Rothganger, Jea...
ICS
2003
Tsinghua U.
15 years 12 months ago
Roccom: an object-oriented, data-centric software integration framework for multiphysics simulations
We describe an object-oriented software integration frameccom, abstracted from our five years of experience in developing a complex, integrated code for rocket simulation. Roccom...
Xiangmin Jiao, Michael T. Campbell, Michael T. Hea...
RTA
2001
Springer
15 years 11 months ago
Matching Power
In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori