318 search results - page 55 / 64 » On the equivalence of linear complementarity problems |
SODA
2008
ACM
15 years 1 months ago
2008
ACM
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
AAAI
1998
15 years 1 months ago
1998
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
117
click to vote
ALGORITHMICA
2007
15 years 15 days ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
CORR
2010
Springer
15 years 14 days ago
2010
Springer
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
87
Voted
IJSYSC
2008
15 years 11 days ago
2008
The problem of estimating motion and structure from a sequence of images has been a major research theme in machine vision for many years and remains one of the most challenging o...