Sciweavers

846 search results - page 139 / 170
» Fundamentals of Media Theory
Sort
View
CORR
2011
Springer
151views Education» more  CORR 2011»
15 years 18 days ago
Generating and Searching Families of FFT Algorithms
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...
Steve Haynal, Heidi Haynal
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 10 months ago
Tight Upper Bounds for Streett and Parity Complementation
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...
Yang Cai, Ting Zhang
ATAL
2011
Springer
14 years 6 months ago
Game theory-based opponent modeling in large imperfect-information games
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...
Sam Ganzfried, Tuomas Sandholm
CEC
2011
IEEE
14 years 6 months ago
Towards human-like social multi-agents with memetic automaton
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...
Liang Feng, Yew-Soon Ong, Ah-Hwee Tan, Xianshun Ch...
PODS
2012
ACM
276views Database» more  PODS 2012»
13 years 8 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
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...
Zengfeng Huang, Ke Yi, Qin Zhang