206 search results - page 34 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
205
click to vote
CIDR
2011
14 years 1 months ago
2011
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
The problem of results merging in distributed information retrieval environments has been approached by two different directions in research. Estimation approaches attempt to cal...
FUIN
2006
14 years 9 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...