6045 search results - page 1109 / 1209 » Computable Linearizations of Well-partial-orderings |
NIPS
2008
13 years 10 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
PDPTA
2007
13 years 10 months ago
2007
- Serial algorithms to evaluate the Gabor transform of a discrete signal are bound by the length of signal for which the transform can be evaluated. The time taken, if machine memo...
RSS
2007
13 years 10 months ago
2007
— Several recent algorithms have formulated the SLAM problem in terms of non-linear pose graph optimization. These algorithms are attractive because they offer lower computationa...
PPSC
2001
13 years 10 months ago
2001
Crew pairing generation is a time consuming part of the complex process of airline crew scheduling. We present a parallel algorithm for this problem's solution and several im...
IJCAI
2003
13 years 10 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....