1927 search results - page 242 / 386 » UMDAs for dynamic optimization problems |
122
click to vote
ICAC
2007
IEEE
15 years 10 months ago
2007
IEEE
—A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online op...
144
Voted
ICRA
1998
IEEE
15 years 8 months ago
1998
IEEE
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
155
Voted
AUTOMATICA
2007
15 years 3 months ago
2007
In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment ...
132
Voted
IJHPCA
2006
15 years 3 months ago
2006
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...
133
Voted
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...