1414 search results - page 42 / 283 » Cover Time and Broadcast Time |
ICDM
2002
IEEE
14 years 2 months ago
2002
IEEE
Mining association rules may generate a large numbers of rules making the results hard to analyze manually. Pasquier et al. have discussed the generation of GuiguesDuquenne–Luxe...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
AAAI
2006
13 years 11 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...
ALGORITHMICA
2004
13 years 9 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...