Sciweavers

1583 search results - page 60 / 317
» Standardization and Competitive Advantage
Sort
View
ACISICIS
2007
IEEE
15 years 4 months ago
A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
Mauritsius Tuga, Regina Berretta, Alexandre Mendes
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
15 years 3 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
WEA
2007
Springer
158views Algorithms» more  WEA 2007»
15 years 3 months ago
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
Markus Behle, Michael Jünger, Frauke Liers
ICICIC
2006
IEEE
15 years 3 months ago
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
Pan Junjie, Wang Dingwei
ISORC
2006
IEEE
15 years 3 months ago
Looking Ahead in Open Multithreaded Transactions
Open multithreaded transactions constitute building blocks that allow a developer to design and structure the execution of complex distributed systems featuring cooperative and co...
Maxime Monod, Jörg Kienzle, Alexander Romanov...