5314 search results - page 696 / 1063 » Hybrid Dynamic Programming |
176
Voted
JCO
2002
15 years 6 months ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
209
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
194
click to vote
ICSE
2010
IEEE-ACM
15 years 5 months ago
2010
IEEE-ACM
To stay aware of relevant information and avoid productivity loss, a developer has to continuously read through new incoming information. Our approach supports the integration of ...
179
click to vote
KI
2010
Springer
15 years 4 months ago
2010
Springer
A robot that is to assist humans in everyday activities should not only be efficient, but also choose actions that are understandable for a person. One characteristic of human task...
214
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...