6142 search results - page 933 / 1229 » The Complexity of Partition Functions |
174
click to vote
ER
2007
Springer
16 years 26 days ago
2007
Springer
The emerging area of business process intelligence attempts to enhance the analytical capabilities of business process management systems by employing data warehousing and mining t...
183
click to vote
FSTTCS
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
153
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
We present what we believe is the first attempt to physically reconstruct the exploratory mechanism of genetic regulatory networks. Feedback plays a crucial role during developme...
217
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
171
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...