Sciweavers

8695 search results - page 35 / 1739
» Making the Complex Simple
Sort
View
SIGCOMM
1994
ACM
15 years 2 months ago
Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and sel sh, and (2) central admini...
Scott Shenker
IJAR
2007
69views more  IJAR 2007»
14 years 10 months ago
Decision making under uncertainty using imprecise probabilities
Various ways for decision making with imprecise probabilities—admissibility, maximal expected utility, maximality, E-admissibility, Γ-maximax, Γ-maximin, all of which are well...
Matthias C. M. Troffaes
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
15 years 10 months ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala
FUIN
2008
108views more  FUIN 2008»
14 years 10 months ago
A Simple Proof of Miller-Yu Theorem
A few years ago a nice criterion of Martin-L
Laurent Bienvenu, Wolfgang Merkle, Alexander Shen
ACRI
2004
Springer
15 years 3 months ago
Chaos in a Simple Cellular Automaton Model of a Uniform Society
In this work we study the collective behavior in a model of a simplified homogeneous society. Each agent is modeled as a binary “perceptron”, receiving neighbors’ opinions a...
Franco Bagnoli, Fabio Franci, Raúl Rechtman