Sciweavers

18090 search results - page 179 / 3618
» Computing by Only Observing
Sort
View
CHES
2004
Springer
182views Cryptology» more  CHES 2004»
15 years 11 months ago
Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems
In the current work we propose a pipelining scheme for implementing Elliptic Curve Cryptosystems (ECC). The scalar multiplication is the dominant operation in ECC. It is computed b...
Pradeep Kumar Mishra
PPSN
2004
Springer
15 years 11 months ago
Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
Jano I. van Hemert, Neil Urquhart
IPPS
2003
IEEE
15 years 11 months ago
A Low Cost Fault Tolerant Packet Routing for Parallel Computers
This work presents a new switching mechanism to tolerate arbitrary faults in interconnection networks with a negligible implementation cost. Although our routing technique can be ...
Valentin Puente, José A. Gregorio, Ram&oacu...
HPDC
1999
IEEE
15 years 10 months ago
Predicting the CPU Availability of Time-shared Unix Systems on the Computational Grid
In this paper we focus on the problem of making short and medium term forecasts of CPU availability on timeshared Unix systems. We evaluate the accuracy with which availability ca...
Richard Wolski, Neil T. Spring, Jim Hayes
AGI
2008
15 years 7 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov