Sciweavers

674 search results - page 51 / 135
» Arguments and Results
Sort
View
AUTOMATICA
2007
102views more  AUTOMATICA 2007»
13 years 9 months ago
An extension of duality to a game-theoretic framework
This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solv...
Lacra Pavel
TIT
2010
61views Education» more  TIT 2010»
13 years 3 months ago
Tunstall code, Khodak variations, and random walks
A variable-to-fixed length encoder partitions the source string into variable-length phrases that belong to a given and fixed dictionary. Tunstall, and independently Khodak, desig...
Michael Drmota, Yuriy A. Reznik, Wojciech Szpankow...
ATAL
2007
Springer
14 years 24 days ago
Hypotheses refinement under topological communication constraints
We investigate the properties of a multiagent system where each (distributed) agent locally perceives its environment. Upon perception of an unexpected event, each agent locally c...
Gauvain Bourgne, Gael Hette, Nicolas Maudet, Suzan...
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 7 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
NDJFL
2010
13 years 3 months ago
Polyadic Quantification via Denoting Concepts
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
Ori Simchen