Sciweavers

11371 search results - page 94 / 2275
» The network inhibition problem
Sort
View
ASIAMS
2007
IEEE
16 years 23 days ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
ATMOS
2008
187views Optimization» more  ATMOS 2008»
15 years 8 months ago
Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
Karl Nachtigall, Jens Opitz
IPPS
2003
IEEE
15 years 11 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
CATS
2008
15 years 7 months ago
An ILP for the metro-line crossing problem
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
SPDP
1991
IEEE
15 years 10 months ago
Parallel and distributed algorithms for finite constraint satisfaction problems
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
Ying Zhang, Alan K. Mackworth