9842 search results - page 354 / 1969 » Problem complexity |
131
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— This paper deals with code-aided (CA) maximumlikelihood (ML) phase and timing ambiguity resolution. We propose a methodology based on the sum-product algorithm (SPA) to...
179
Voted
INFORMATICALT
2006
15 years 6 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
159
click to vote
JAPLL
2006
15 years 6 months ago
2006
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
168
Voted
EUSFLAT
2001
15 years 8 months ago
2001
In many practical problems, we must combine ("fuse") data represented in different formats, e.g., statistical, fuzzy, etc. The simpler the data, the easier to combine th...
187
click to vote
MP
2008
15 years 6 months ago
2008
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...