Sciweavers

16596 search results - page 50 / 3320
» Generalized Assignment Problems
Sort
View
JAR
2000
149views more  JAR 2000»
14 years 9 months ago
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
Patrick Mills, Edward P. K. Tsang
CSR
2007
Springer
15 years 3 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
COR
2010
127views more  COR 2010»
14 years 9 months ago
Discrepancy search for the flexible job shop scheduling problem
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
Abir Ben Hmida, Mohamed Haouari, Marie-José...
CORR
2010
Springer
157views Education» more  CORR 2010»
14 years 9 months ago
Detecting Coordination Problems in Collaborative Software Development Environments
Software development is rarely an individual effort and generally involves teams of developers collaborating to generate good reliable code. Among the software code there exist te...
Chintan Amrit, Jos van Hillegersberg
AICCSA
2005
IEEE
104views Hardware» more  AICCSA 2005»
15 years 3 months ago
Multicast address management in the Internet: a study of the port blocking problem
A critical issue in multicast communication is how to identify multicast groups. In the Internet, multicast addresses and port numbers distinguish multicast groups from each other...
Emad Eldin Mohamed, Hussein M. Abdel-Wahab, I. Sal...