Sciweavers

13500 search results - page 269 / 2700
» Improved analysis of D
Sort
View
IPPS
2000
IEEE
15 years 11 months ago
Improving Throughput and Utilization in Parallel Machines through Concurrent Gang
In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensiv...
Fabrício Alves Barbosa da Silva, Isaac D. S...
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
15 years 11 months ago
Montgomery Exponentiation with no Final Subtractions: Improved Results
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
Gaël Hachez, Jean-Jacques Quisquater
ILP
2000
Springer
15 years 10 months ago
Using ILP to Improve Planning in Hierarchical Reinforcement Learning
Hierarchical reinforcement learning has been proposed as a solution to the problem of scaling up reinforcement learning. The RLTOPs Hierarchical Reinforcement Learning System is an...
Mark D. Reid, Malcolm R. K. Ryan
SAS
2000
Springer
15 years 10 months ago
Flattening Is an Improvement
d Abstract) James Riely1 and Jan Prins2 1 DePaul University 2 University of North Carolina at Chapel Hill Abstract. Flattening is a program transformation that eliminates nested pa...
James Riely, Jan Prins
HCI
2007
15 years 8 months ago
Improving the Mobility Performance of Autonomous Unmanned Ground Vehicles by Adding the Ability to 'Sense/Feel' Their Local Envi
This paper explores how a ‘learning’ algorithm can be added to UGV’s by giving it the ability to test the terrain through ‘feeling’ using incorporated sensors, which woul...
Siddharth Odedra, Stephen D. Prior, Mehmet Karaman...