Sciweavers

4007 search results - page 382 / 802
» Computation with imprecise probabilities
Sort
View
CAD
1998
Springer
15 years 6 months ago
Knot-removal surface fairing using search strategies
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
Stefanie Hahmann, Stefan Konz
SIGMETRICS
2002
ACM
142views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
Exact aggregate solutions for M/G/1-type Markov processes
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...
Alma Riska, Evgenia Smirni
SAC
2008
ACM
15 years 6 months ago
Decentralized coordination strategies for the vehicle routing problem
Modern software control systems must cope with uncertainty, manage dynamic environments, as well as provide greater flexibility. Distributed agent-based control systems are the id...
Matteo Vasirani, Sascha Ossowski
PERCOM
2010
ACM
15 years 5 months ago
Faster Bayesian context inference by using dynamic value ranges
—This paper shows how to reduce evaluation time for context inference. Probabilistic Context Inference has proven to be a good representation of the physical reality with uncerta...
Korbinian Frank, Patrick Robertson, Sergio Fortes ...
ACL
2010
15 years 4 months ago
Training Phrase Translation Models with Leaving-One-Out
Several attempts have been made to learn phrase translation probabilities for phrasebased statistical machine translation that go beyond pure counting of phrases in word-aligned t...
Joern Wuebker, Arne Mauser, Hermann Ney