Sciweavers

467 search results - page 48 / 94
» The General Yard Allocation Problem
Sort
View
213
Voted

Publication
233views
14 years 2 months ago
Sparse reward processes
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
Christos Dimitrakakis
148
Voted
IJRR
2006
126views more  IJRR 2006»
15 years 3 months ago
Market-based Multirobot Coordination for Complex Tasks
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...
Robert Zlot, Anthony Stentz
171
Voted
SIGMETRICS
2012
ACM
248views Hardware» more  SIGMETRICS 2012»
13 years 6 months ago
Pricing cloud bandwidth reservations under demand uncertainty
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...
Di Niu, Chen Feng, Baochun Li
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
16 years 3 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
124
Voted
AUSAI
2005
Springer
15 years 9 months ago
Adaptive Utility-Based Scheduling in Resource-Constrained Systems
This paper addresses the problem of scheduling jobs in soft real-time systems, where the utility of completing each job decreases over time. We present a utility-based framework fo...
David Vengerov