Sciweavers

1019 search results - page 75 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
IJRR
2010
186views more  IJRR 2010»
13 years 7 months ago
The Highly Adaptive SDM Hand: Design and Performance Evaluation
The inherent uncertainty associated with unstructured environments makes establishing a successful grasp difficult. Traditional approaches to this problem involve hands that are c...
Aaron M. Dollar, Robert D. Howe
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
14 years 2 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 7 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
DAC
2010
ACM
13 years 9 months ago
Parallel multigrid preconditioning on graphics processing units (GPUs) for robust power grid analysis
Leveraging the power of nowadays graphics processing units for robust power grid simulation remains a challenging task. Existing preconditioned iterative methods that require inco...
Zhuo Feng, Zhiyu Zeng
USS
2010
13 years 6 months ago
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
Yitao Duan, NetEase Youdao, John Canny, Justin Z. ...