Sciweavers

3663 search results - page 111 / 733
» Problems in the ontology of computer programs
Sort
View
CSJM
2006
59views more  CSJM 2006»
14 years 10 months ago
Traveling Salesman Problem with Transportation
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
Valeriu Ungureanu
CEC
2009
IEEE
15 years 4 months ago
Local search based evolutionary multi-objective optimization algorithm for constrained and unconstrained problems
Abstract— Evolutionary multi-objective optimization algorithms are commonly used to obtain a set of non-dominated solutions for over a decade. Recently, a lot of emphasis have be...
Karthik Sindhya, Ankur Sinha, Kalyanmoy Deb, Kaisa...
IFIP
2005
Springer
15 years 3 months ago
Numerical Approximation of a Control Problem for Advection-Diffusion Processes
Two different approaches are proposed to enhance the efficiency of the numerical resolution of optimal control problems governed by a linear advection– diffusion equation. In ...
Alfio Quarteroni, Gianluigi Rozza, L. Dedè,...
HPCN
1995
Springer
15 years 1 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck
PODC
2009
ACM
15 years 10 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young