55 search results - page 3 / 11 » Proof Granularity as an Empirical Problem |
139
click to vote
PPSN
2004
Springer
15 years 10 months ago
2004
Springer
Theoretically and empirically it is clear that a genetic algorithm with crossover will outperform a genetic algorithm without crossover in some fitness landscapes, and vice versa i...
175
click to vote
AI
2008
Springer
15 years 4 months ago
2008
Springer
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
155
click to vote
SIGSOFT
2010
ACM
15 years 3 months ago
2010
ACM
Concurrent programs are notoriously difficult to debug. We see two main reasons for this: 1) concurrency bugs are often difficult to reproduce, 2) traces of buggy concurrent execu...
154
click to vote
IJCGT
2011
14 years 9 months ago
2011
This paper proposes an automatic model-based approach that enables adaptive decision making in modern virtual games. It builds upon the Integrated MDP and POMDP Learning AgeNT (IM...
145
click to vote
ICASSP
2009
IEEE
16 years 7 days ago
2009
IEEE
For the first time, a proof of the sifting process (SP) and so the empirical mode decomposition (EMD), is given. For doing this, lower and upper envelopes are modeled in a more c...