3946 search results - page 353 / 790 » The computational complexity of choice sets |
139
Voted
PNPM
1989
15 years 11 months ago
1989
We present SPNP, a powerful GSPN package developed at Duke University. SPNP allows the modeling of complex system behaviors. Advanced constructs are available, such as markingdepe...
150
Voted
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
235
click to vote
DEXAW
2006
IEEE
15 years 8 months ago
2006
IEEE
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consist...
152
Voted
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper, we consider the problem of ontology evolution in the face of a change operation. We devise a general-purpose algorithm for determining the effects and side...
172
click to vote
IWEC
2004
15 years 8 months ago
2004
Procedural techniques will soon automate many aspects of content creation for computer games. We describe an efficient, deterministic, methodology for procedurally generating 3D ga...