1420 search results - page 97 / 284 » Multi-point Constructive Search |
176
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
170
click to vote
AAAI
1998
15 years 8 months ago
1998
We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...
205
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
208
Voted
EUROCAST
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
206
click to vote
WEBI
2007
Springer
16 years 1 months ago
2007
Springer
— We propose a hierarchical approach to document categorization that requires no pre-configuration and maps the semantic document space to a predefined taxonomy. The utilizatio...