10493 search results - page 498 / 2099 » Dynamic Word Problems |
148
click to vote
WIOPT
2010
IEEE
15 years 5 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
209
click to vote
CP
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
133
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
In this paper we develop boundary value methods for detecting Sacker-Sell spectra in discrete time dynamical systems. The algorithms are advancements of earlier methods for comput...
211
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We consider the problem of parameter estimation for signals characterized by sums of parameterized functions. We present a dynamic dictionary subset selection approach to paramete...
170
click to vote
JPDC
2008
15 years 6 months ago
2008
This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all...