Sciweavers

447 search results - page 7 / 90
» Internet shopping optimization problem
Sort
View
IPPS
2007
IEEE
15 years 9 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
ATAL
2007
Springer
15 years 9 months ago
Scaling-up shopbots: a dynamic allocation-based approach
In this paper we consider the problem of eCommerce comparison shopping agents (shopbots) that are limited by capacity constraints. In light of the phenomenal increase both in dema...
David Sarne, Sarit Kraus, Takayuki Ito
ICWE
2010
Springer
15 years 1 months ago
Linking Related Documents: Combining Tag Clouds and Search Queries
Nowadays, Web encyclopedias suffer from a high bounce rate. Typically, users come to an encyclopaedia from a search engine and upon reading the first page on the site they leave it...
Christoph Trattner, Denis Helic
WSC
2000
15 years 4 months ago
Simulation of an evolutionary tuned fuzzy dispatching system for automated guided vehicles
This paper presents the development and simulation of a novel Genetic Algorithm (GA) based methodology applied to optimal tuning of a fuzzy dispatching system for a fleet of autom...
Kok Kiong Tan, K. Z. Tang
ANOR
2008
171views more  ANOR 2008»
15 years 3 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet