606 search results - page 66 / 122 » Discrete Time Process Algebra |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
TIME
2002
IEEE
14 years 17 days ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
ASIACRYPT
2000
Springer
14 years 8 hour ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
TEC
2002
13 years 7 months ago
2002
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
COMPSAC
2002
IEEE
14 years 19 days ago
2002
IEEE
In this paper we propose an analytical approach for estimating the reliability of a component-based software. This methodology assumes that the software components are heterogeneo...