Sciweavers

447 search results - page 8 / 90
» Internet shopping optimization problem
Sort
View
81
Voted
ICALP
2010
Springer
15 years 2 months ago
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
Nikhil Bansal, Subhash Khot
92
Voted
ICTAI
1994
IEEE
15 years 2 months ago
A Distributed Scheduling Framework
A distributed problem solving approach to job shop scheduling is described in this paper. The approach views the system as an Organisation. Agents are assigned di erent roles and ...
Carla P. Gomes, Austin Tate, Lyn Thomas
CEC
2007
IEEE
15 years 4 months ago
Modified genetic algorithm for job-shop scheduling: A gap utilization technique
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
S. M. Kamrul Hasan, Ruhul A. Sarker, David Cornfor...
CORR
2010
Springer
157views Education» more  CORR 2010»
14 years 8 months ago
Stochastic Budget Optimization in Internet Advertising
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...
Bhaskar DasGupta, S. Muthukrishnan
INFOCOM
2005
IEEE
15 years 3 months ago
Optimal ISP subscription for Internet multihoming: algorithm design and implication analysis
— Multihoming is a popular method used by large enterprises and stub ISPs to connect to the Internet to reduce cost and improve performance. Recently researchers have studied the...
Hao Wang, Haiyong Xie 0002, Lili Qiu, Abraham Silb...