6105 search results - page 1158 / 1221 » A Parallel Algorithm for Bound-Smoothing |
116
click to vote
AAAI
1998
15 years 2 months ago
1998
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
108
click to vote
AIPS
2000
15 years 2 months ago
2000
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
109
click to vote
IPCO
1998
15 years 2 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
105
click to vote
ACL
1997
15 years 2 months ago
1997
Many multilingual NLP applications need to translate words between different languages, but cannot afford the computational expense of inducing or applying a full translation mode...
NIPS
1996
15 years 2 months ago
1996
A central theme of computational vision research has been the realization that reliable estimation of local scene properties requires propagating measurements across the image. Ma...