1012 search results - page 123 / 203 » Segment intersection searching problems in general settings |
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variabl...
PR
2008
14 years 11 months ago
2008
Clustering in gene expression data sets is a challenging problem. Different algorithms for clustering of genes have been proposed. However due to the large number of genes only a ...
100
click to vote
ECRTS
2008
IEEE
15 years 6 months ago
2008
IEEE
Task period adaptations are often used to alleviate temporal overload conditions in real-time systems. Existing frameworks assume that only task periods are adjustable and that ta...
CISSE
2008
Springer
15 years 1 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
UAI
1990
15 years 1 months ago
1990
The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for ...