Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,588,472 papers from all fields of science
Search
Sign In
Create Free Account
Constraint algorithm
Known as:
LINCS (constraint)
, M-SHAKE
, Shake
Expand
In computational chemistry, a constraint algorithm is a method for satisfying the Newtonian motion of a rigid body which consists of mass points. A…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Broader (2)
Computational chemistry
Computational physics
Energy drift
Jacobian matrix and determinant
LU decomposition
List of algorithms
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The Maximum Rank of the Transfer Matrix in 1-D Mirrored Interferometric Aperture Synthesis
Liangbing Chen
,
Zhaomin Rao
,
Yuhao Wang
,
Huilin Zhou
IEEE Geoscience and Remote Sensing Letters
2017
Corpus ID: 3765698
Because the principle of mirrored interferometric aperture synthesis (MIAS) is different from that of the conventional…
Expand
2011
2011
Wavelet kernel learning
F. Yger
,
A. Rakotomamonjy
Pattern Recognition
2011
Corpus ID: 14895028
2009
2009
Linear Complexity Context-Free Parsing Pipelines via Chart Constraints
Brian Roark
,
Kristy Hollingshead
North American Chapter of the Association for…
2009
Corpus ID: 6610908
In this paper, we extend methods from Roark and Hollingshead (2008) for reducing the worst-case complexity of a context-free…
Expand
2008
2008
Iterative learning-based minimum tracking error entropy controller for robotic manipulators with random communication time delays
J. Zhang
,
Hong Wang
2008
Corpus ID: 17843955
A novel feedback control method for robotic manipulators with random communication delays by combining the optimal P-type…
Expand
2007
2007
Mapping the New Frontiers of Private Ordering: Afterword
Martha M. Ertman
2007
Corpus ID: 142327090
Defining the limits of contract is an important project in contemporary contracts scholarship. Professor Ertman's Afterward to…
Expand
Highly Cited
2004
Highly Cited
2004
All things being unequal : locality in movement
T. Doggett
2004
Corpus ID: 170955806
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 2004.
2003
2003
On the performance of different channel pre-compensation techniques for uplink time division duplex MC-CDMA
I. Cosovic
,
M. Schnell
,
Andreas Springer
IEEE 58th Vehicular Technology Conference. VTC…
2003
Corpus ID: 643383
Time division duplex multi-carrier code-division multiple-access (TDD/MC-CDMA) operates on the premise that there is a strong…
Expand
2000
2000
Transmit diversity based on space-time block codes in frequency selective Rayleigh fading DS-CDMA systems
G. Klang
,
A. Naguib
VTC-Spring. IEEE 51st Vehicular Technology…
2000
Corpus ID: 61934544
Exploring the temporal and spatial domains both at the receiver and transmitter offers important means for considerably improving…
Expand
1989
1989
Application of neural constraint satisfaction networks to vision
R. Mohan
International Joint Conference on Neural…
1989
Corpus ID: 27657741
Summary form only given, as follows. The problem of constraint satisfaction is common in computer vision. The author maps this…
Expand
Review
1987
Review
1987
PANDA2: Program for Minimum Weight Design of Stiffened, Composite, Locally Buckled Panels
D. Bushnell
1987
Corpus ID: 56167784
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE