306 search results - page 46 / 62 » On the Minimal Uncompletable Word Problem |
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
ALGORITHMICA
2000
13 years 7 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
JSSPP
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. As multi-core processors proliferate, it has become more important than ever to ensure efficient execution of parallel jobs on multiprocessor systems. In this paper, we s...
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper we design coordination policies for a routing problem requiring human-assisted classification of targets through analysis of information gathered on-site by auto...
ISORC
2005
IEEE
14 years 1 months ago
2005
IEEE
Transcoding is an important technology which adapts the same multimedia object to diverse mobile appliances; thus, users’ requests for a specified version of a multimedia objec...