Sciweavers

2194 search results - page 437 / 439
» Improving HLRTA*( k )
Sort
View
ATAL
2009
Springer
14 years 2 months ago
On fast exploration in 2D and 3D terrains with multiple robots
We present a fast multi-robotic exploration methodology for 2D and 3D terrains. An asynchronous exploration strategy is introduced which shows significant improvements over the ex...
Rahul Sawhney, K. Madhava Krishna, Kannan Srinatha...
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
14 years 2 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
FOCS
2000
IEEE
14 years 2 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
IEEEPACT
2000
IEEE
14 years 2 months ago
Dynamic Branch Prediction for a VLIW Processor
This paper describes the design of a dynamic branchpredictorfor a VLIW processor. The developed branch predictor predicts the direction of a branch, i.e., taken or not taken, and ...
Jan Hoogerbrugge
SIGUCCS
2000
ACM
14 years 2 months ago
Knowledgebase Integration with a 24-hour Help Desk
The University of Pittsburgh's Computing Services and Systems Development organization is focused on the needs of the faculty and student population, totaling nearly 40,000 u...
Jay Graham, Brian K. Hart