Sciweavers

2714 search results - page 452 / 543
» Approximation Schemes for Scheduling
Sort
View
INFOCOM
2006
IEEE
15 years 6 months ago
Sketch Guided Sampling - Using On-Line Estimates of Flow Size for Adaptive Data Collection
— Monitoring the traffic in high-speed networks is a data intensive problem. Uniform packet sampling is the most popular technique for reducing the amount of data the network mo...
Abhishek Kumar, Jun Xu
CIG
2005
IEEE
15 years 6 months ago
Forcing Neurocontrollers to Exploit Sensory Symmetry Through Hard-wired Modularity in the Game of Cellz
Several attempts have been made in the past to construct encoding schemes that allow modularity to emerge in evolving systems, but success is limited. We believe that in order to c...
Julian Togelius, Simon M. Lucas
102
Voted
WINE
2005
Springer
109views Economy» more  WINE 2005»
15 years 6 months ago
Subjective-Cost Policy Routing
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
Joan Feigenbaum, David R. Karger, Vahab S. Mirrokn...
101
Voted
INFOCOM
2000
IEEE
15 years 5 months ago
Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
Abstract—Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechan...
Zhiruo Cao, Zheng Wang, Ellen W. Zegura
SIGGRAPH
1998
ACM
15 years 4 months ago
Progressive Forest Split Compression
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
Gabriel Taubin, André Guéziec, Willi...