3455 search results - page 596 / 691 » Generalized Game Trees |
132
click to vote
ECML
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. This paper studies the properties and performance of models for estimating local probability distributions which are used as components of larger probabilistic systems â€...
175
click to vote
FSTTCS
2003
Springer
15 years 9 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
127
click to vote
GCB
2003
Springer
15 years 9 months ago
2003
Springer
The further development of analytical techniques based on gas chromatography and mass spectrometry now facilitate the generation of larger sets of metabolite concentration data. T...
135
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
132
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
—Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. ...