Sciweavers

3016 search results - page 184 / 604
» The Online Transportation Problem
Sort
View
JCO
2010
99views more  JCO 2010»
15 years 2 months ago
Online scheduling with a buffer on related machines
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
György Dósa, Leah Epstein
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 4 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
ATAL
2007
Springer
15 years 10 months ago
Approximate and online multi-issue negotiation
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
15 years 10 months ago
Online View Maintenance Under a Response-Time Constraint
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...
Kamesh Munagala, Jun Yang 0001, Hai Yu
ELPUB
1999
ACM
15 years 8 months ago
Online Publishing as a Support for Scholarly Communication in Dynamic Knowledge Communities
Internet based services, particularly asynchronous communication services, offer an environment suited to the rise of knowledge communities. Knowledge communities, or invisible co...
Ana Alice Baptista, Elóy Rodrigues, Altamir...