Sciweavers

1282 search results - page 188 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
CODES
2003
IEEE
15 years 9 months ago
A multiobjective optimization model for exploring multiprocessor mappings of process networks
In the Sesame framework, we develop a modeling and simulation environment for the efficient design space exploration of heterogeneous embedded systems. Since Sesame recognizes se...
Cagkan Erbas, Selin C. Erbas, Andy D. Pimentel
SCHEDULING
2008
67views more  SCHEDULING 2008»
15 years 3 months ago
Exact train pathing
Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it...
Viswanath Nagarajan, Abhiram G. Ranade
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
15 years 5 months ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder
PAAMS
2009
Springer
15 years 8 months ago
A Realistic Approach to Solve the Nash Welfare
The multi-agent resource allocation problem is the negotiation of a set of resources among a population of agents, in order to maximize a social welfare function. The purpose of th...
Antoine Nongaillard, Philippe Mathieu, Brigitte Ja...
FOCS
1995
IEEE
15 years 7 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos