Sciweavers

1041 search results - page 45 / 209
» Randomizing Reductions of Search Problems
Sort
View
ICCAD
2004
IEEE
100views Hardware» more  ICCAD 2004»
15 years 11 months ago
A chip-level electrostatic discharge simulation strategy
This paper presents a chip-level charged device model (CDM) electrostatic discharge (ESD) simulation method. The chip-level simulation is formulated as a DC analysis problem. A ne...
Haifeng Qian, Joseph N. Kozhaya, Sani R. Nassif, S...
JSAC
2008
106views more  JSAC 2008»
15 years 2 months ago
Enhanced multiuser random beamforming: dealing with the not so large number of users case
We consider the downlink of a wireless system with an M-antenna base station and K single-antenna users. A limited feedback-based scheduling and precoding scenario is considered th...
Marios Kountouris, David Gesbert, Thomas Sälz...
EVOW
2007
Springer
15 years 8 months 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
93
Voted
CEC
2008
IEEE
15 years 8 months ago
Solving one-billion-bit Noisy OneMax problem using Estimation Distribution Algorithm with Arithmetic Coding
— This paper presents an algorithm which combines Estimation Distribution Algorithm with a chromosome compression scheme to solve large scale Noisy OneMax problem. The search spa...
Worasait Suwannik, Prabhas Chongstitvatana
CIAC
2006
Springer
111views Algorithms» more  CIAC 2006»
15 years 6 months ago
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...