Sciweavers

3049 search results - page 298 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICMLA
2007
15 years 8 months ago
Learning bayesian networks consistent with the optimal branching
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
Alexandra M. Carvalho, Arlindo L. Oliveira
GECCO
2004
Springer
16 years 1 days ago
Dynamic Uniform Scaling for Multiobjective Genetic Algorithms
Before Multiobjective EvolutionaryAlgorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further ...
Gerulf K. M. Pedersen, David E. Goldberg
DAC
1996
ACM
15 years 10 months ago
A Hardware/Software Partitioning Algorithm for Designing Pipelined ASIPs with Least Gate Counts
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...
Nguyen-Ngoc Bình, Masaharu Imai, Akichika S...
DAC
1995
ACM
15 years 10 months ago
New Performance-Driven FPGA Routing Algorithms
—Motivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions signiï...
Michael J. Alexander, Gabriel Robins
GLOBECOM
2007
IEEE
15 years 6 months ago
A Gray-Code Type Bit Assignment Algorithm for Unitary Space-Time Constellations
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
Adam Panagos, Kurt L. Kosbar