318 search results - page 6 / 64 » On the equivalence of linear complementarity problems |
111
click to vote
DAC
2003
ACM
15 years 5 months 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...
102
Voted
ICRA
2005
IEEE
15 years 6 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 ...
90
Voted
ACISICIS
2005
IEEE
15 years 2 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...
126
Voted
SIAMJO
2002
15 years 15 hour 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 ...
117
click to vote
RECOMB
2007
Springer
16 years 20 days 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...