Sciweavers

1064 search results - page 59 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
16 years 4 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
157
Voted
AAAI
1996
15 years 5 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker
AAAI
2007
15 years 6 months ago
Kernel Regression with Order Preferences
We propose a novel kernel regression algorithm which takes into account order preferences on unlabeled data. Such preferences have the form that point x1 has a larger target value...
Xiaojin Zhu, Andrew B. Goldberg
NIPS
2000
15 years 5 months ago
Learning Switching Linear Models of Human Motion
The human figure exhibits complex and rich dynamic behavior that is both nonlinear and time-varying. Effective models of human dynamics can be learned from motion capture data usi...
Vladimir Pavlovic, James M. Rehg, John MacCormick
DAC
1995
ACM
15 years 7 months ago
On the Bounded-Skew Clock and Steiner Routing Problems
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
Dennis J.-H. Huang, Andrew B. Kahng, Chung-Wen Alb...