Sciweavers

13376 search results - page 54 / 2676
» Problem Solving with
Sort
View
133
Voted
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
14 years 10 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
91
Voted
IPPS
2003
IEEE
15 years 6 months ago
A GRASP-Based Algorithm for Solving DVE Partitioning Problem
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
Pedro Morillo, Marcos Fernández
97
Voted
EOR
2002
84views more  EOR 2002»
15 years 15 days ago
Solving container loading problems by block arrangement
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a g...
Michael Eley
87
Voted
CEC
2005
IEEE
15 years 6 months ago
Evolving dispatching rules for solving the flexible job-shop problem
We solve the Flexible Job-Shop Problem (FJSP) by using dispatching rules discovered through Genetic Programming (GP). While Simple Priority Rules (SPR) have been widely applied in ...
Nhu Binh Ho, Joc Cing Tay
IJON
2008
177views more  IJON 2008»
15 years 21 days ago
An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
Eu Jin Teoh, Kay Chen Tan, H. J. Tang, Cheng Xiang...