689 search results - page 111 / 138 » Encapsulation theory fundamentals |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
ATAL
2011
Springer
12 years 9 months ago
2011
Springer
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
CEC
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—Memetics is a new science that has attracted increasing attentions in the recent decades. Beyond the formalism of simple hybrids, adaptive hybrids and memetic algorithms...
PODS
2012
ACM
12 years 7 days ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...