Sciweavers

16188 search results - page 388 / 3238
» The Optimal PAC Algorithm
Sort
View
CEC
2007
IEEE
16 years 1 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...
ATAL
2007
Springer
16 years 29 days ago
An equal excess negotiation algorithm for coalition formation
Coalition formation is an important form of interaction in multiagent systems. It enables the agents to satisfy tasks that they would otherwise be unable to perform, or would perf...
Hrishikesh J. Goradia, José M. Vidal
ESA
2005
Springer
125views Algorithms» more  ESA 2005»
16 years 9 days ago
Online Primal-Dual Algorithms for Covering and Packing Problems
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
Niv Buchbinder, Joseph Naor
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
16 years 9 days ago
An approach for QoS-aware service composition based on genetic algorithms
Web services are rapidly changing the landscape of software engineering. One of the most interesting challenges introduced by web services is represented by Quality Of Service (Qo...
Gerardo Canfora, Massimiliano Di Penta, Raffaele E...
LSSC
2005
Springer
16 years 8 days ago
Ant Algorithm for Grid Scheduling Problem
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
Stefka Fidanova, Mariya K. Durchova