Sciweavers

3455 search results - page 201 / 691
» Generalized Game Trees
Sort
View
TSMC
1998
97views more  TSMC 1998»
15 years 6 months ago
Parallel algorithms for modules of learning automata
— Parallel algorithms are presented for modules of learning automata with the objective of improving their speed of convergence without compromising accuracy. A general procedure...
M. A. L. Thathachar, M. T. Arvind
WINE
2010
Springer
189views Economy» more  WINE 2010»
15 years 4 months ago
The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds
Abstract. We show a formal duality between certain equilibrium concepts, including the correlated and coarse correlated equilibrium, and analysis frameworks for proving bounds on t...
Uri Nadav, Tim Roughgarden
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 6 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen
CIKM
2005
Springer
16 years 2 days ago
Localized routing trees for query processing in sensor networks
In this paper, we propose a novel energy-efficient approach, a localized routing tree (LRT) coupled with a route redirection (RR) strategy, to support various types of queries. LR...
Jie Lian, Lei Chen 0002, Kshirasagar Naik, M. Tame...
ACISICIS
2005
IEEE
15 years 8 months ago
Equivalence of Transforming Non-Linear DACG to Linear Concept Tree
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
Wenyi Bi, Junping Sun