5214 search results - page 292 / 1043 » The Online Specialization Problem |
173
click to vote
RTAS
2008
IEEE
16 years 1 months ago
2008
IEEE
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
228
click to vote
NIPS
1997
15 years 8 months ago
1997
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
162
click to vote
AUTOMATICA
2002
15 years 6 months ago
2002
For discrete-time linear time invariant systems with constraints on inputs and states, we develop an algorithm to determine explicitly, the state feedback control law which minimi...
171
click to vote
JDA
2011
15 years 1 months ago
2011
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
177
click to vote
VRML
2003
ACM
15 years 12 months ago
2003
ACM
New acquisition and modeling tools make it easier to create 3D models, and affordable and powerful graphics hardware makes it easier to use them. As a result, the number of 3D mo...