Sciweavers

1816 search results - page 178 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
CISS
2008
IEEE
16 years 1 months ago
A genetic algorithm for designing constellations with low error floors
—The error floor of bit-interleaved coded modulation with iterative decoding (BICM-ID) can be minimized for a particular constellation by maximizing the harmonic mean of the squ...
Matthew C. Valenti, Raghu Doppalapudi, Don J. Torr...
AIPS
2009
15 years 7 months ago
An Optimal Temporally Expressive Planner: Initial Results and Application to P2P Network Optimization
Temporally expressive planning, an important class of temporal planning, has attracted much attention lately. Temporally expressive planning is difficult; few existing planners ca...
Ruoyun Huang, Yixin Chen, Weixiong Zhang
SIAMJO
2008
139views more  SIAMJO 2008»
15 years 6 months ago
An Augmented Primal-Dual Method for Linear Conic Programs
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...
Florian Jarre, Franz Rendl
EUROGP
1999
Springer
137views Optimization» more  EUROGP 1999»
15 years 10 months ago
Evolving Controllers for Autonomous Agents Using Genetically Programmed Networks
– This article presents a new approach to the evolution of controllers for autonomous agents. We propose the evolution of a connectionist structure where each node has an associa...
Arlindo Silva, Ana Neves, Ernesto Costa
ICASSP
2011
IEEE
14 years 10 months ago
Dual constrained TV-based regularization
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...
Camille Couprie, Hugues Talbot, Jean-Christophe Pe...