Sciweavers

4377 search results - page 637 / 876
» Mass problems and randomness
Sort
View
INFORMATICALT
2002
91views more  INFORMATICALT 2002»
15 years 6 months ago
Bayesian Heuristic Approach to Scheduling
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
Jonas Mockus
JOC
2002
99views more  JOC 2002»
15 years 6 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski
RAS
2002
129views more  RAS 2002»
15 years 6 months ago
Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun
TOG
2002
133views more  TOG 2002»
15 years 6 months ago
Interactive motion generation from examples
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
Okan Arikan, David A. Forsyth
SAC
2008
ACM
15 years 6 months ago
Whom should I trust?: the impact of key figures on cold start recommendations
Generating adequate recommendations for newcomers is a hard problem for a recommender system (RS) due to lack of detailed user profiles and social preference data. Empirical evide...
Patricia Victor, Chris Cornelis, Ankur Teredesai, ...