2194 search results - page 205 / 439 » Improving HLRTA*( k ) |
131
click to vote
ETT
2007
15 years 1 months ago
2007
A powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) has been proposed based on minimizing analytical upper bounds on the error probability in the ...
124
click to vote
NN
2008
Springer
15 years 1 months ago
2008
Springer
Wide-area coordinating control is becoming an important issue and a challenging problem in the power industry. This paper proposes a novel optimal wide-area coordinating neurocont...
116
click to vote
MP
2006
15 years 1 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
115
click to vote
MP
2006
15 years 1 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
123
click to vote
NCA
2006
IEEE
15 years 1 months ago
2006
IEEE
Scientists involved in the area of proteomics are currently seeking integrated, customised and validated research solutions to better expedite their work in proteomics analyses and...