Sciweavers

914 search results - page 68 / 183
» Branch and Bound on the Network Model
Sort
View
TWC
2008
109views more  TWC 2008»
15 years 6 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad Hoc Networks
Abstract-- This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets success...
Atef Abdrabou, Weihua Zhuang
ISAAC
2003
Springer
97views Algorithms» more  ISAAC 2003»
15 years 11 months ago
Equilibria for Networks with Malicious Users
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavio...
George Karakostas, Anastasios Viglas
CORR
2008
Springer
208views Education» more  CORR 2008»
15 years 6 months ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
16 years 7 months ago
Proof Sketches: Verifiable In-Network Aggregation
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
Minos N. Garofalakis, Joseph M. Hellerstein, Petro...
NCA
2002
IEEE
15 years 6 months ago
The Construction of Smooth Models using Irregular Embeddings Determined by a Gamma Test Analysis
One of the key problems in forming a smooth model from input-output data is the determination of which input variables are relevant in predicting a given output. In this paper we ...
Alban P. M. Tsui, Antonia J. Jones, A. Guedes de O...