318 search results - page 6 / 64 » On the equivalence of linear complementarity problems |
DAC
2003
ACM
14 years 22 days ago
2003
ACM
A new methodology is presented to solve a strongly nonlinear circuit, characterized by Piece-Wise Linear (PWL) functions, symbolically and explicitly in terms of its circuit param...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s algorithm for solving linear complementarity ...
ACISICIS
2005
IEEE
13 years 9 months ago
2005
IEEE
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
SIAMJO
2002
13 years 7 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
RECOMB
2007
Springer
14 years 7 months ago
2007
Springer
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...