1486 search results - page 19 / 298 » Algorithms for two-box covering |
119
click to vote
SODA
2001
ACM
15 years 2 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
85
Voted
BIRTHDAY
2009
Springer
15 years 7 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
83
Voted
CORR
2008
Springer
15 years 28 days ago
2008
Springer
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...
108
Voted
AAAI
2006
15 years 2 months ago
2006
In this paper, we describe an evolutionary approach to one of the most challenging problems in computer music: modeling the knowledge applied by a musician when performing a score...
171
Voted
ESCAPE
2007
Springer
15 years 7 months ago
2007
Springer