1547 search results - page 12 / 310 » Solving Knapsack Problems in a Sticker Based Model |
EACL
1989
ACL Anthology
13 years 8 months ago
1989
ACL Anthology
The structure of problem-solving discourse in the expert advising setting can be modeled by adding a layer of metaplans to a plan-based model of the task domain. Classes of metapl...
GECCO
2008
Springer
13 years 8 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...
ITS
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents an approach to the design of a learning environment in a mathematical domain (elementary combinatorics) where problem solving is based more on modelling than o...
AAAI
2000
13 years 8 months ago
2000
Developing tools that allow non-programmers to enter knowledge has been an ongoing challenge for AI. In recent years researchers have investigated a variety ofpromising approaches...
COR
2008
13 years 7 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...