Sciweavers

613 search results - page 95 / 123
» Finding and Fixing Faults
Sort
View
TIT
2008
102views more  TIT 2008»
14 years 11 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
ALGORITHMICA
2004
125views more  ALGORITHMICA 2004»
14 years 11 months ago
Multidimensional Cube Packing
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa...
APIN
2002
70views more  APIN 2002»
14 years 11 months ago
Compact Unstructured Representations for Evolutionary Design
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...
Hatem Hamda, François Jouve, Evelyne Lutton...
CERA
2004
93views more  CERA 2004»
14 years 11 months ago
Virtual-Build-to-Order as a Mass Customization Order Fulfilment Model
: Virtual-build-to-order (VBTO) is a form of order fulfilment system in which the producer has the ability to search across the entire pipeline of finished stock, products in produ...
Philip G. Brabazon, Bart L. MacCarthy
CORR
2002
Springer
123views Education» more  CORR 2002»
14 years 11 months ago
Survey propagation: an algorithm for satisfiability
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
Alfredo Braunstein, Marc Mézard, Riccardo Z...