JORS
2010
13 years 7 months ago
2010
The facility layout problem is concerned with finding the most efficient arrangement of a given number of departments with unequal area requirements within a facility. The facilit...
CLOUDCOM
2010
Springer
13 years 10 months ago
2010
Springer
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
TIT
2008
14 years 19 days ago
2008
Abstract. We discuss some applications of the pairing inversion problem and outline some potential approaches for solving it. Our analysis of these approaches gives further evidenc...
DAM
2008
14 years 24 days ago
2008
For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition nu...
AAAI
1998
14 years 2 months ago
1998
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
ECAI
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. We address the problem of extracting Minimal Unsatisfiable Cores (MUCs) from constraint networks. This computationally hard problem has a practical interest in many appli...
RTCSA
1999
IEEE
14 years 5 months ago
1999
IEEE
Scheduling in an environment with constraints of many different types is known to be a hard problem. We tackle this problem for an integrated steel plant in Ghent, Belgium, using ...
KBSE
2007
IEEE
14 years 7 months ago
2007
IEEE
Monitoring the satisfaction of software requirements and diagnosing what went wrong in case of failure is a hard problem that has received little attention in the Software and Req...
CIMCA
2008
IEEE
14 years 7 months ago
2008
IEEE
—The computational grid provides a promising platform for the deployment of various high-performance computing applications. In computational grid, an efficient scheduling of tas...
ICPR
2004
IEEE
15 years 1 months ago
2004
IEEE
Model selection in unsupervised learning is a hard problem. In this paper a simple selection criterion for hyperparameters in one-class classifiers (OCCs) is proposed. It makes us...