Sciweavers

452 search results - page 29 / 91
» A mean field approach for optimization in discrete time
Sort
View
CPAIOR
2008
Springer
13 years 10 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck
AIPS
2009
13 years 9 months ago
Information-Theoretic Approach to Efficient Adaptive Path Planning for Mobile Robotic Environmental Sensing
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
TCSB
2008
13 years 8 months ago
Clustering Time-Series Gene Expression Data with Unequal Time Intervals
Clustering gene expression data given in terms of time-series is a challenging problem that imposes its own particular constraints, namely exchanging two or more time points is not...
Luis Rueda, Ataul Bari, Alioune Ngom
CVIU
2008
114views more  CVIU 2008»
13 years 8 months ago
On geometric variational models for inpainting surface holes
Geometric approaches for filling-in surface holes are introduced and studied in this paper. The basic idea is to represent the surface of interest in implicit form, and fill-in th...
Vicent Caselles, Gloria Haro, Guillermo Sapiro, Jo...
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
14 years 22 days ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan