Sciweavers

2593 search results - page 296 / 519
» constraints 2007
Sort
View
EVOW
2007
Springer
16 years 24 days ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz
EVOW
2007
Springer
16 years 24 days ago
Genetic Representations for Evolutionary Minimization of Network Coding Resources
Abstract. We demonstrate how a genetic algorithm solves the problem of minimizing the resources used for network coding, subject to a throughput constraint, in a multicast scenario...
Minkyu Kim, Varun Aggarwal, Una-May O'Reilly, Muri...
FMCAD
2007
Springer
16 years 24 days ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton

Publication
319views
16 years 24 days ago
Epsilon Stereo Pairs
Human stereo vision works by fusing a pair of perspective images with a purely horizontal parallax. Recent developments suggest that very few varieties of multiperspective stereo p...
Yuanyuan Ding and Jingyi Yu
FSEN
2007
Springer
16 years 24 days ago
Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata
Abstract. A communication protocol consists of a sequence of messages used by peer entities to communicate. Each entity in a network is equipped by at least one protocol stack. Due...
Mahdi Niamanesh, Rasool Jalili