15485 search results - page 508 / 3097 » Computing Optimal Subsets |
156
click to vote
STACS
2004
Springer
16 years 9 days ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
204
click to vote
ECRTS
2002
IEEE
2002
IEEE
Managing Multi-Mode Tasks with Time Cost and Quality Levels using Optimal Discrete Control Synthesis
15 years 12 months ago
Real-time control systems are complex to design, and automation support is important. We are interested in systems with multiple tasks, each with multiple modes, implementing a fu...
185
click to vote
IPPS
2002
IEEE
15 years 12 months ago
2002
IEEE
This paper discusses concept lattices and some of their applications in component library development and compiler optimizations. Ongoing work on concept-based userextensible simp...
175
click to vote
ERSHOV
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...
164
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...