152 search results - page 11 / 31 » An Experimental Study of Random Knapsack Problems |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
CP
2000
Springer
13 years 11 months ago
2000
Springer
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierar...
MSWIM
2005
ACM
14 years 8 days ago
2005
ACM
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...
CP
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
KDD
2006
ACM
14 years 7 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...