Sciweavers

1193 search results - page 129 / 239
» A primer of simple theories
Sort
View
LCN
2008
IEEE
16 years 25 days ago
An analysis on error servers for stochastic network calculus
—Network calculus is a recently developed theory dealing with queuing systems found in computer networks with focus on service guarantee analysis. In the current network calculus...
Jing Xie, Yuming Jiang
ATAL
2005
Springer
15 years 12 months ago
Approximating state estimation in multiagent settings using particle filters
State estimation consists of updating an agent’s belief given executed actions and observed evidence to date. In single agent environments, the state estimation can be formalize...
Prashant Doshi, Piotr J. Gmytrasiewicz
COMPGEOM
2004
ACM
15 years 12 months ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato
SIGECOM
2003
ACM
110views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
Virtual worlds: fast and strategyproof auctions for dynamic resource allocation
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
Chaki Ng, David C. Parkes, Margo I. Seltzer
SIGCOMM
1996
ACM
15 years 10 months ago
A Channel Access Scheme for Large Dense Packet Radio Networks
Prior work in the eld of packet radio networks has often assumed a simple success-if-exclusive model of successful reception. This simple model is insucient to model interference...
Timothy J. Shepard