16504 search results - page 394 / 3301 » New Problems, New Solutions |
191
Voted
NA
2010
15 years 5 months ago
2010
In the numerical solution of ODEs, it is now possible to develop efficient techniques that will deliver approximate solutions that are piecewise polynomials. The resulting methods...
168
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
An efficient and general multiple kernel learning (MKL) algorithm has been recently proposed by Sonnenburg et al. (2006). This approach has opened new perspectives since it makes ...
167
click to vote
BIBE
2007
IEEE
16 years 1 months ago
2007
IEEE
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
169
Voted
CP
2007
Springer
16 years 1 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
195
Voted
HIPC
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...