Sciweavers

14548 search results - page 362 / 2910
» The Optimal Path-Matching Problem
Sort
View
185
Voted
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 11 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
APIN
2006
207views more  APIN 2006»
15 years 6 months ago
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
The Vehicle Routing Problem with Time windows (VRPTW) is an extension of the capacity constrained Vehicle Routing Problem (VRP). The VRPTW is NP-Complete and instances with 100 cus...
Beatrice M. Ombuki, Brian Ross, Franklin Hanshar
TRANSCI
2008
80views more  TRANSCI 2008»
15 years 6 months ago
An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is sum of a congestion function and a disutility function. We pro...
Frédéric Babonneau, Jean-Philippe Vi...
TEC
2002
108views more  TEC 2002»
15 years 6 months ago
Analysis and modeling of control tasks in dynamic systems
Most applications of evolutionary algorithms (EAs) deal with static optimization problems. However, in recent years, there has been a growing interest in timevarying (dynamic) prob...
Rasmus K. Ursem, Thiemo Krink, Mikkel T. Jensen, Z...
CORR
2012
Springer
229views Education» more  CORR 2012»
14 years 2 months ago
Resource Allocation with Subcarrier Pairing in OFDMA Two-Way Relay Networks
Abstract—This study considers an orthogonal frequencydivision multiple-access (OFDMA)-based multi-user two-way relay network where multiple mobile stations (MSs) communicate with...
Hao Zhang, Yuan Liu, Meixia Tao