6693 search results - page 284 / 1339 » Methods of Automatic Algorithm Generation |
185
click to vote
EOR
2010
15 years 6 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
160
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
Proceedings of IEEE Data Mining, IEEE Press, pp. 581-584, 2002. We describe an interactive way to generate a set of clusters for a given data set. The clustering is done by constr...
175
click to vote
QSIC
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
181
click to vote
CONSTRAINTS
2006
15 years 6 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
208
click to vote
IWMM
1998
Springer
15 years 10 months ago
1998
Springer
Mark and sweep garbage collectors (GC) are classical but still very efficient automatic memory management systems. Although challenged by other kinds of systems, such as copying c...