5244 search results - page 461 / 1049 » Structural Complexity of AvgBPP |
173
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
161
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...
175
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...
218
click to vote
AR
2007
15 years 7 months ago
2007
In robotics, recognition of human activity has been used extensively for robot task learning through imitation and demonstration. However, there has not been much work on modeling...
191
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...