6562 search results - page 194 / 1313 » Noetherianity and Combination Problems |
253
click to vote
JMLR
2012
13 years 9 months ago
2012
This paper presents new and effective algorithms for learning kernels. In particular, as shown by our empirical results, these algorithms consistently outperform the so-called uni...
220
click to vote
CADE
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
139
click to vote
ICCBR
1999
Springer
15 years 10 months ago
1999
Springer
We discuss several problems of analogy-driven proof plan construction which prevent a solution for more diæcult target problems or make a solution very expensive. Some of these pr...
164
click to vote
AAIM
2008
Springer
15 years 8 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
143
click to vote
EOR
2006
15 years 6 months ago
2006
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...