8496 search results - page 421 / 1700 » Problem Solving and Complex Systems |
178
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— This article addresses the fast solution of a Quadratic Program underlying a Linear Model Predictive Control scheme that generates walking motions. We introduce an algorithm wh...
181
click to vote
AMW
2010
15 years 8 months ago
2010
We consider incomplete specifications of XML documents in the presence of schema information and integrity constraints. We show that integrity constraints such as keys and foreign ...
150
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
185
Voted
TCS
2008
15 years 6 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
181
click to vote
COMGEO
2011
ACM
15 years 1 months ago
2011
ACM
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...