Sciweavers

8413 search results - page 62 / 1683
» Ordering Problem Subgoals
Sort
View
ICDE
2002
IEEE
128views Database» more  ICDE 2002»
14 years 9 months ago
Efficiently Ordering Query Plans for Data Integration
The goal of a data integration system is to provide a uniform interface to a multitude of data sources. Given a user query formulated in this interface, the system translates it i...
AnHai Doan, Alon Y. Halevy
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
14 years 2 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
ECSQARU
2009
Springer
14 years 2 months ago
Local Computation Schemes with Partially Ordered Preferences
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...
Hélène Fargier, Nic Wilson
ANOR
2008
90views more  ANOR 2008»
13 years 8 months ago
Multiple orders per job batch scheduling with incompatible jobs
: The growth in demand for semiconductors has been accompanied by intense competition between semiconductor manufacturers to satisfy customer on-time delivery needs. This paper is ...
Vishnu Erramilli, Scott J. Mason
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 8 months ago
A New Cryptosystem Based On Hidden Order Groups
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
Amitabh Saxena, Ben Soh