92 search results - page 11 / 19 » Meta Reasoning in ACL2 |
ICML
2000
IEEE
14 years 8 months ago
2000
IEEE
Landmarking is a novel approach to describing tasks in meta-learning. Previous approaches to meta-learning mostly considered only statistics-inspired measures of the data as a sou...
EUROCAST
2009
Springer
14 years 2 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...
19
Voted
COMMA
2008
13 years 9 months ago
2008
Abstract. A recent extension to Dung's argumentation framework allows for arguments to express preferences between other arguments. Value based argumentation can be formalised...
AIPS
2006
13 years 9 months ago
2006
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
COMPSAC
2004
IEEE
13 years 11 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...