15033 search results - page 21 / 3007 » Complexity Theory and Algorithms |
EDUTAINMENT
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we present a novel method for dynamic terrain in battlefield and an efficient plan to simulate crater in the battle. We explore a few methods for dynamic terrain sur...
ICDT
2010
ACM
15 years 1 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
83
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
APAL
2004
14 years 9 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
JMLR
2010
14 years 4 months ago
2010
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...