Sciweavers

JUCS
2006
101views more  JUCS 2006»
15 years 9 days ago
DS/CDMA Multiuser Detection with Evolutionary Algorithms
This work analyses two heuristic algorithms based on the genetic evolution theory applied to direct sequence code division multiple access (DS/CDMA) communication systems. For diff...
Fernando Ciriaco, Taufik Abrão, Paul Jean E...
94
Voted
JUCS
2006
88views more  JUCS 2006»
15 years 9 days ago
Parameter Estimation of the Cauchy Distribution in Information Theory Approach
: As we know the Cauchy distribution plays an important role in Probability Theory and Statistics. In this paper, we investigate the estimation of the location and the scale parame...
Ferenc Nagy
84
Voted
JSW
2006
78views more  JSW 2006»
15 years 9 days ago
Hybrid Genetic Algorithm for Design of Robust Communication Systems
A novel hybrid genetic algorithm (GA) for jointly optimizing source and channel codes is presented in this paper. The algorithm first uses GA for the coarse search of source and ch...
Chien-Min Ou, Jing-Jhih Chen, Wen-Jyi Hwang
MP
2008
129views more  MP 2008»
15 years 9 days ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
EOR
2007
174views more  EOR 2007»
15 years 9 days ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
MOR
2008
94views more  MOR 2008»
15 years 9 days ago
Parametric Integer Programming in Fixed Dimension
We consider the following problem: Given a rational matrix A Qm
Friedrich Eisenbrand, Gennady Shmonin
JSC
2006
132views more  JSC 2006»
15 years 10 days ago
From an approximate to an exact absolute polynomial factorization
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
Guillaume Chèze, André Galligo
91
Voted
JSAT
2006
119views more  JSAT 2006»
15 years 10 days ago
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. This algorithm uses the clauseshorte...
Evgeny Dantsin, Alexander Wolpert
JSAC
2006
88views more  JSAC 2006»
15 years 10 days ago
Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks
This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converter...
Nina Skorin-Kapov
102
Voted
ML
2008
ACM
100views Machine Learning» more  ML 2008»
15 years 10 days ago
Generalized ordering-search for learning directed probabilistic logical models
Abstract. Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although...
Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendri...