2421 search results - page 300 / 485 » Approximate Flow-Aware Networking |
118
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
111
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
135
Voted
ESA
2008
Springer
15 years 4 months ago
2008
Springer
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...
97
Voted
AAAI
2006
15 years 4 months ago
2006
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an ...
127
Voted
UAI
2000
15 years 3 months ago
2000
In this paper we address the problem of learning the structure of a Bayesian network in domains with continuous variables. This task requires a procedure for comparing different c...