3136 search results - page 503 / 628 » Comparison of Clique-Listing Algorithms |
241
click to vote
JCO
2006
15 years 6 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
162
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
161
click to vote
SIGMETRICS
1997
ACM
15 years 10 months ago
1997
ACM
One of the open questions in the design of multimedia storage servers is in what order to serve incoming requests. Given the capability provided by the disk layout and scheduling ...
192
click to vote
CORR
2010
Springer
15 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...
180
click to vote
JCST
2008
15 years 6 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...