Sciweavers

4781 search results - page 22 / 957
» Online algorithms for network design
Sort
View
ICDCS
2010
IEEE
14 years 11 days ago
Quantifying and Querying Network Reachability
—Quantifying and querying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenanc...
Amir R. Khakpour, Alex X. Liu
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
14 years 2 months ago
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
Niv Buchbinder, Kamal Jain, Joseph Naor
ADHOC
2007
107views more  ADHOC 2007»
13 years 8 months ago
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
Weifa Liang, Yuzhen Liu
TSE
1998
128views more  TSE 1998»
13 years 8 months ago
Modeling and Evaluating Design Alternatives for an On-Line Instrumentation System: A Case Study
—This paper demonstrates the use of a model-based evaluation approach for instrumentation systems (ISs). The overall objective of this study is to provide early feedback to tool ...
Abdul Waheed, Diane T. Rover, Jeffrey K. Hollingsw...
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 2 months ago
Learning and anticipation in online dynamic optimization with evolutionary algorithms: the stochastic case
The focus of this paper is on how to design evolutionary algorithms (EAs) for solving stochastic dynamic optimization problems online, i.e. as time goes by. For a proper design, t...
Peter A. N. Bosman, Han La Poutré