Sciweavers

2182 search results - page 268 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
121
Voted
BMCBI
2008
211views more  BMCBI 2008»
15 years 2 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen
111
Voted
IROS
2008
IEEE
126views Robotics» more  IROS 2008»
15 years 9 months ago
High-dimensional underactuated motion planning via task space control
Abstract— Kinodynamic planning algorithms have the potential to find feasible control trajectories which accomplish a task even in very nonlinear or constrained dynamical system...
Alexander C. Shkolnik, Russ Tedrake
111
Voted
TSMC
1998
78views more  TSMC 1998»
15 years 2 months ago
Automata learning and intelligent tertiary searching for stochastic point location
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
B. John Oommen, Govindachari Raghunath
147
Voted
SIAMIS
2010
190views more  SIAMIS 2010»
14 years 9 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
PODC
2010
ACM
15 years 6 months ago
Group mutual exclusion in O(log n) RMR
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
Vibhor Bhatt, Chien-Chung Huang