7106 search results - page 748 / 1422 » Restricted Complexity, General Complexity |
166
click to vote
AMC
2007
15 years 7 months ago
2007
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
179
click to vote
ANOR
2010
15 years 7 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
200
click to vote
APAL
2008
15 years 7 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
194
click to vote
CCR
2008
15 years 7 months ago
2008
Modeling Internet growth is important both for understanding the current network and to predict and improve its future. To date, Internet models have typically attempted to explai...
187
click to vote
CG
2008
Springer
15 years 7 months ago
2008
Springer
We address the problem of an efficient image-space reconstruction of adaptively sampled scenes in the context of point-based and line-based graphics. The imagespace reconstruction...