31 search results - page 4 / 7 » One-test-at-a-time heuristic search for interaction test sui... |
GAMEON
2003
13 years 6 months ago
2003
In this paper, we discuss another approach based on mimicry for interactive comedy, a relatively new genre in interactive drama. An interactive comedy system is proposed in which ...
EVOW
2004
Springer
13 years 11 months ago
2004
Springer
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...
GD
1999
Springer
13 years 9 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
NIPS
2007
13 years 7 months ago
2007
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...