Sciweavers

4526 search results - page 327 / 906
» Algorithmic problems related to the Internet
Sort
View
NIPS
2008
15 years 8 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
ESA
2000
Springer
141views Algorithms» more  ESA 2000»
15 years 10 months ago
Preemptive Scheduling with Rejection
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
Han Hoogeveen, Martin Skutella, Gerhard J. Woeging...
AUTOMATICA
2002
73views more  AUTOMATICA 2002»
15 years 6 months ago
Iterative learning control with initial rectifying action
This paper addresses the initial shift problem in iterative learning control with system relative degree. The tracking error caused by nonzero initial shift is detected when apply...
Mingxuan Sun, Danwei Wang
209
Voted
SODA
2010
ACM
147views Algorithms» more  SODA 2010»
15 years 4 months ago
Energy Efficient Scheduling via Partial Shutdown
Motivated by issues of saving energy in data centers we define a collection of new problems referred to as "machine activation" problems. The central framework we introd...
Samir Khuller, Jian Li, Barna Saha
AAAI
2008
15 years 9 months ago
HTN-MAKER: Learning HTNs with Minimal Additional Knowledge Engineering Required
We describe HTN-MAKER, an algorithm for learning hierarchical planning knowledge in the form of decomposition methods for Hierarchical Task Networks (HTNs). HTNMAKER takes as inpu...
Chad Hogg, Héctor Muñoz-Avila, Ugur ...