Sciweavers

3122 search results - page 179 / 625
» A Theory of Network Equivalence
Sort
View
LISP
2006
105views more  LISP 2006»
15 years 6 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
APAL
2004
105views more  APAL 2004»
15 years 6 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
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...
Emil Jerábek
LICS
2010
IEEE
15 years 5 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
ATAL
2011
Springer
14 years 6 months ago
Maximum causal entropy correlated equilibria for Markov games
Motivated by a machine learning perspective—that gametheoretic equilibria constraints should serve as guidelines for predicting agents’ strategies, we introduce maximum causal...
Brian D. Ziebart, J. Andrew Bagnell, Anind K. Dey
GLOBECOM
2007
IEEE
16 years 25 days ago
Network-Calculus-Based Analysis of Power Management in Video Sensor Networks
— This paper considers two important issues for video sensor network, (1) timely delivery of captured video stream and (2) energy-efficient network design. Based on network calc...
Yanchuan Cao, Yuan Xue, Yi Cui