1647 search results - page 193 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
142
Voted
FSTTCS
2000
Springer
15 years 8 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
130
click to vote
UAI
2004
15 years 6 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
119
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
136
click to vote
COMPUTING
2010
15 years 2 months ago
2010
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
146
click to vote
IPL
2010
15 years 3 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...