Sciweavers

4432 search results - page 113 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
IWINAC
2007
Springer
15 years 9 months ago
Tackling the Error Correcting Code Problem Via the Cooperation of Local-Search-Based Agents
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
Jhon Edgar Amaya, Carlos Cotta, Antonio J. Fern&aa...
ANOR
2005
72views more  ANOR 2005»
15 years 3 months ago
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...
CDC
2009
IEEE
109views Control Systems» more  CDC 2009»
15 years 1 months ago
Exact solution for the max-min quantum error recovery problem
This paper considers the max-min quantum error recovery problem; the recovery channel to be designed maximizes the fidelity between input and output states of a given noisy channel...
Naoki Yamamoto
EURODAC
1994
IEEE
186views VHDL» more  EURODAC 1994»
15 years 7 months ago
Algorithms for a switch module routing problem
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Shashidhar Thakur, D. F. Wong, S. Muthukrishnan
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 2 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende