581 search results - page 74 / 117 » Approximation algorithms for constructing wavelength routing... |
115
click to vote
CIAC
2010
Springer
15 years 4 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
100
click to vote
PODS
2006
ACM
16 years 1 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
110
click to vote
ECCC
2006
15 years 1 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
137
click to vote
ATMOS
2010
15 years 13 days ago
2010
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
175
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....