Sciweavers

6542 search results - page 1230 / 1309
» The tao of parallelism in algorithms
Sort
View
AAAI
1998
13 years 10 months ago
Multi Machine Scheduling: An Agent-Based Approach
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...
Rama Akkiraju, Pinar Keskinocak, Sesh Murthy, Fred...
AIPS
2000
13 years 10 months ago
Admissible Heuristics for Optimal Planning
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...
Patrik Haslum, Hector Geffner
IPCO
1998
99views Optimization» more  IPCO 1998»
13 years 10 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
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...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
ACL
1997
13 years 10 months ago
A Word-to-Word Model of Translational Equivalence
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...
I. Dan Melamed
NIPS
1996
13 years 10 months ago
Interpreting Images by Propagating Bayesian Beliefs
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...
Yair Weiss
« Prev « First page 1230 / 1309 Last » Next »