14548 search results - page 366 / 2910 » The Optimal Path-Matching Problem |
156
click to vote
COMPUTING
2007
15 years 6 months ago
2007
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For we...
134
click to vote
ANOR
2002
15 years 6 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
160
click to vote
GECCO
2007
Springer
16 years 26 days ago
2007
Springer
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
180
click to vote
DEXA
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. This paper presents an application that aims at identifying optimal locations based on partially ordered constraints. It combines a tool developed in this project that al...
199
click to vote
RTSS
2003
IEEE
15 years 12 months ago
2003
IEEE
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...