Sciweavers

Share
JORS
2010
102views more  JORS 2010»
8 years 1 months ago
A spring-embedding approach for the facility layout problem
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...
I. Castillo, T. Sim
CLOUDCOM
2010
Springer
8 years 4 months ago
Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce
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...
Di-Wei Huang, Jimmy Lin
TIT
2008
93views more  TIT 2008»
8 years 6 months ago
Aspects of Pairing Inversion
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...
Steven D. Galbraith, Florian Hess, Frederik Vercau...
DAM
2008
85views more  DAM 2008»
8 years 6 months ago
The competition numbers of complete tripartite graphs
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...
Suh-Ryung Kim, Yoshio Sano
AAAI
1998
8 years 7 months ago
Multi Machine Scheduling: An Agent-Based Approach
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...
Rama Akkiraju, Pinar Keskinocak, Sesh Murthy, Fred...
ECAI
2006
Springer
8 years 10 months ago
Extracting MUCs from Constraint Networks
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...
Fred Hemery, Christophe Lecoutre, Lakhdar Sais, Fr...
RTCSA
1999
IEEE
8 years 10 months ago
Scheduling a Steel Plant with Timed Automata
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 ...
Ansgar Fehnker
KBSE
2007
IEEE
9 years 15 days ago
An automated approach to monitoring and diagnosing requirements
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...
Yiqiao Wang, Sheila A. McIlraith, Yijun Yu, John M...
CIMCA
2008
IEEE
9 years 21 days ago
LGR: The New Genetic Based Scheduler for Grid Computing Systems
—The computational grid provides a promising platform for the deployment of various high-performance computing applications. In computational grid, an efficient scheduling of tas...
Leili Mohammad Khanli, Seyad Naser Razavi, Nima Ja...
ICPR
2004
IEEE
9 years 7 months ago
A Consistency-Based Model Selection for One-Class Classification
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...
David M. J. Tax, Klaus-Robert Müller
books