Sciweavers

1568 search results - page 42 / 314
» The problem of examination questions in algorithmics
Sort
View
CONEXT
2006
ACM
15 years 4 months ago
Reformulating the monitor placement problem: optimal network-wide sampling
Confronted with the generalization of monitoring in operational networks, researchers have proposed placement algorithms that can help ISPs deploy their monitoring infrastructure ...
Gion Reto Cantieni, Gianluca Iannaccone, Chadi Bar...
ISCC
2005
IEEE
116views Communications» more  ISCC 2005»
15 years 3 months ago
Link Buffer Sizing: A New Look at the Old Problem
We revisit the question of how much buffer an IP router should allocate for its Droptail FIFO link. For a long time, setting the buffer size to the bitrate-delay product has been ...
Sergey Gorinsky, Anshul Kantawala, Jonathan S. Tur...
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
14 years 12 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
CVPR
2007
IEEE
16 years 3 days ago
Change Detection in a 3-d World
This paper examines the problem of detecting changes in a 3-d scene from a sequence of images, taken by cameras with arbitrary but known pose. No prior knowledge of the state of n...
Thomas Pollard, Joseph L. Mundy
GECCO
2005
Springer
157views Optimization» more  GECCO 2005»
15 years 3 months ago
Simple addition of ranking method for constrained optimization in evolutionary algorithms
During the optimization of a constrained problem using evolutionary algorithms (EAs), an individual in the population can be described using three important properties, i.e., obje...
Pei Yee Ho, Kazuyuki Shimizu