920 search results - page 109 / 184 » Generating Satisfiable Problem Instances |
107
click to vote
IJAMCIGI
2010
14 years 10 months ago
2010
Hyper-heuristics are identified as the methodologies that search the space generated by a finite set of low level heuristics for solving difficult problems. One of the iterative h...
DATE
2009
IEEE
15 years 7 months ago
2009
IEEE
—Today verification, testing and debugging of SystemC models can be applied at an early stage in the design process. To support these techniques gaining required information of ...
98
Voted
AH
2008
Springer
15 years 7 months ago
2008
Springer
In an attempt to support traditional classroom assessment processes with fully computerized methods, we have developed a method for adaptive assessment suitable for well structured...
122
Voted
ASP
2005
Springer
15 years 6 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
111
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
This study examines the utility of meta-grammar constant generation on a series of benchmark problems. The performance of the meta-grammar approach is compared to a grammar which ...