Sciweavers

16 search results - page 3 / 4
» Generalized Watchman Route Problem with Discrete View Cost
Sort
View
SIGCOMM
2009
ACM
14 years 2 months ago
Stable and flexible iBGP
Routing oscillation is highly detrimental. It can decrease performance and lead to a high level of update churn placing unnecessary workload on router the problem is distributed b...
Ashley Flavel, Matthew Roughan
HEURISTICS
2000
127views more  HEURISTICS 2000»
13 years 7 months ago
Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the p...
Joel W. Gannett
PRL
2006
221views more  PRL 2006»
13 years 7 months ago
Towards on-line saccade planning for high-resolution image sensing
This paper considers the problem of designing an active observer to plan a sequence of decisions regarding what target to look at, through a foveal-sensing action. We propose a fr...
Alberto Del Bimbo, Federico Pernici
IWCMC
2006
ACM
14 years 1 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
APPML
2007
154views more  APPML 2007»
13 years 7 months ago
Comparison of distances between measures
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Jean-Michel Morel, Filippo Santambrogio