1176 search results - page 42 / 236 » Implicit Abstraction Heuristics |
AUSAI
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
88
Voted
IJMI
2007
15 years 11 days ago
2007
s from Biomedical Abstracts Patrick Rucha , Celia Boyer c , Christine Chichesterb , Imad Tbahritiab Antoine Geissbühlera , Paul Fabrya , Julien Gobeilla , Violaine Pilletab , Diet...
DAC
2007
ACM
16 years 1 months ago
2007
ACM
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
95
Voted
SI3D
2006
ACM
15 years 6 months ago
2006
ACM
Shade Trees Morgan McGuire George Stathis Hanspeter Pfister Shriram Krishnamurthi Brown University Harvard Extension School MERL Brown University As GPU-powered special effects be...
WEA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...