4131 search results - page 130 / 827 » The Generalized Max-Controlled Set Problem |
140
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
129
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
102
click to vote
ICSE
2008
IEEE-ACM
16 years 3 months ago
2008
IEEE-ACM
Central to the problem frames approach is the distinction of three different descriptions: requirements R, domain assumptions W and specifications S, tied together with the socall...
119
Voted
PLDI
2010
ACM
16 years 22 days ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
135
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...