1628 search results - page 190 / 326 » Partitioning Sets with Genetic Algorithms |
103
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
148
Voted
IJCAI
1993
15 years 4 months ago
1993
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
164
Voted
WAW
2010
Springer
15 years 1 months ago
2010
Springer
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
103
click to vote
CORR
2009
Springer
15 years 1 months ago
2009
Springer
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
146
Voted
ECRTS
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept o...