Sciweavers

2340 search results - page 39 / 468
» Copying and Comparing: Problems and Solutions
Sort
View
ICDM
2006
IEEE
116views Data Mining» more  ICDM 2006»
15 years 5 months ago
Improving Personalization Solutions through Optimal Segmentation of Customer Bases
On the Web, where the search costs are low and the competition is just a mouse click away, it is crucial to segment the customers intelligently in order to offer more targeted and...
Tianyi Jiang, Alexander Tuzhilin
EOR
2008
107views more  EOR 2008»
14 years 12 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
IEEEPACT
2006
IEEE
15 years 5 months ago
Fast, automatic, procedure-level performance tuning
This paper presents an automated performance tuning solution, which partitions a program into a number of tuning sections and finds the best combination of compiler options for e...
Zhelong Pan, Rudolf Eigenmann
JAMDS
2002
155views more  JAMDS 2002»
14 years 11 months ago
A new heuristic for the quadratic assignment problem
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
Zvi Drezner
FSTTCS
2007
Springer
15 years 6 months ago
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
We introduce PEP, the Post Embedding Problem, a variant of PCP where one compares strings with the subword relation, and PEPreg , a further variant where solutions are constrained ...
Pierre Chambart, Ph. Schnoebelen