Sciweavers

511 search results - page 40 / 103
» Lower bounds for distributed markov chain problems
Sort
View
NETWORKS
2008
13 years 7 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
ATAL
2009
Springer
14 years 2 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
BIBE
2005
IEEE
124views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Approximate Global Alignment of Sequences
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
Tamer Kahveci, Venkatakrishnan Ramaswamy, Han Tao,...
TOMACS
2011
139views more  TOMACS 2011»
13 years 2 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
ICCV
1998
IEEE
14 years 9 months ago
A Metric for Distributions with Applications to Image Databases
Proceedings of the 1998 IEEE International Conference on Computer Vision, Bombay, India We introduce a new distance between two distributions that we call the Earth Mover's D...
Yossi Rubner, Carlo Tomasi, Leonidas J. Guibas