Sciweavers

994 search results - page 75 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
CIKM
2009
Springer
15 years 7 months ago
Incremental query evaluation for support vector machines
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
Danzhou Liu, Kien A. Hua
105
Voted
SC
1994
ACM
15 years 4 months ago
Run-time and compile-time support for adaptive irregular problems
In adaptive irregular problems the data arrays are accessed via indirection arrays, and data access patterns change during computation. Implementingsuch problems ondistributed mem...
Shamik D. Sharma, Ravi Ponnusamy, Bongki Moon, Yua...
118
Voted
COR
2007
163views more  COR 2007»
15 years 20 days ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 4 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
ICLP
1997
Springer
15 years 4 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...