Sciweavers

318 search results - page 53 / 64
» On the equivalence of linear complementarity problems
Sort
View
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 1 months ago
Maximum-Likelihood Decoding and Performance Analysis of a Noisy Channel Network with Network Coding
Abstract— We investigate sink decoding methods and performance analysis approaches for a network with intermediate node encoding (coded network). The network consists of statisti...
Ming Xiao, Tor M. Aulin
CICLING
2007
Springer
14 years 1 months ago
Finite-State Technology as a Programming Environment
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
Shuly Wintner
MFCS
2007
Springer
14 years 1 months ago
Evolvability
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
Leslie G. Valiant
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
AGP
1999
IEEE
13 years 11 months ago
Widening Sharing
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill