Sciweavers

8647 search results - page 166 / 1730
» The Container Selection Problem
Sort
View
133
Voted
FSTTCS
2007
Springer
15 years 9 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
ICALP
2007
Springer
15 years 9 months ago
Parameterized Algorithms for Directed Maximum Leaf Problems
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
ICCBR
2005
Springer
15 years 8 months ago
Language Games: Solving the Vocabulary Problem in Multi-Case-Base Reasoning
The problem of heterogeneous case representation poses a major obstacle to realising real-life multi-case-base reasoning (MCBR) systems. The knowledge overhead in developing and ma...
Paolo Avesani, Conor Hayes, Marco Cova
120
Voted
PAKDD
2010
ACM
172views Data Mining» more  PAKDD 2010»
15 years 8 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...
AAAI
2008
15 years 5 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