Sciweavers

517 search results - page 43 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
EUROPAR
2007
Springer
15 years 4 months ago
Cooperation in Multi-organization Scheduling
The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We co...
Fanny Pascual, Krzysztof Rzadca, Denis Trystram
ICC
2008
IEEE
126views Communications» more  ICC 2008»
15 years 4 months ago
Joint Stream Control and Scheduling in Multihop Wireless Networks with MIMO Links
—MIMO links can significantly improve network throughput by supporting multiple concurrent data streams between a pair of nodes and suppressing wireless interference. In this pa...
Brendan Mumey, Jian Tang, Timothy Hahn
PRL
2007
99views more  PRL 2007»
14 years 9 months ago
Polygonal shape description for recognition of partially occluded objects
We introduce a new method for the recognition of partially occluded objects represented only by their contours. Object description, which stems from the inflection point detectio...
Filip Krolupper, Jan Flusser
ACTA
1998
111views more  ACTA 1998»
14 years 9 months ago
Machine Scheduling with Availability Constraints
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
Eric Sanlaville, Günter Schmidt
ML
2002
ACM
154views Machine Learning» more  ML 2002»
14 years 9 months ago
Technical Update: Least-Squares Temporal Difference Learning
TD() is a popular family of algorithms for approximate policy evaluation in large MDPs. TD() works by incrementally updating the value function after each observed transition. It h...
Justin A. Boyan