Sciweavers

4266 search results - page 120 / 854
» The container loading problem
Sort
View
PAKDD
2010
ACM
172views Data Mining» more  PAKDD 2010»
15 years 11 months ago
Semi-supervised Tag Recommendation - Using Untagged Resources to Mitigate Cold-Start Problems
Tag recommender systems are often used in social tagging systems, a popular family of Web 2.0 applications, to assist users in the tagging process. But in cold-start situations i.e...
Christine Preisach, Leandro Balby Marinho, Lars Sc...
STACS
2001
Springer
15 years 10 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 10 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
AAAI
2008
15 years 8 months ago
Hybrid Constraint Tightening for Solving Hybrid Scheduling Problems
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
James C. Boerkoel Jr., Edmund H. Durfee
ALMOB
2006
97views more  ALMOB 2006»
15 years 6 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi