Sciweavers

451 search results - page 47 / 91
» Approximation algorithms for stochastic orienteering
Sort
View
SODA
1997
ACM
119views Algorithms» more  SODA 1997»
13 years 10 months ago
Map Labeling and Its Generalizations
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, ...
COMGEO
2012
ACM
12 years 4 months ago
Algorithms for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
Sergio Cabello, Éric Colin de Verdiè...
WSC
2004
13 years 10 months ago
On Using Monte Carlo Methods for Scheduling
Monte Carlo techniques have long been used (since Buffon's experiment to approximate the value of by tossing a needle onto striped paper) to analyze phenomena which, due to ...
Samarn Chantaravarapan, Ali K. Gunal, Edward J. Wi...
AMAI
2008
Springer
13 years 8 months ago
Bayesian learning of Bayesian networks with informative priors
This paper presents and evaluates an approach to Bayesian model averaging where the models are Bayesian nets (BNs). Prior distributions are defined using stochastic logic programs...
Nicos Angelopoulos, James Cussens
JC
1998
65views more  JC 1998»
13 years 8 months ago
Monte Carlo Complexity of Global Solution of Integral Equations
The problem of global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, whe...
Stefan Heinrich