4934 search results - page 224 / 987 » complexity 2008 |
163
click to vote
AUTONOMICS
2008
ACM
15 years 7 months ago
2008
ACM
A goal of computing and networking systems is to limit administrative requirements for users and operators. A technical systems should be able to configure itself as much as possi...
115
click to vote
CIARP
2008
Springer
15 years 7 months ago
2008
Springer
This report1 considers 2-regions of grid cubes and proposes an algorithm for calculating the number of tunnels of such a region. The graph-theoretical algorithm proceeds layer by l...
143
click to vote
TIT
2008
15 years 5 months ago
2008
A new wavelet-based methodology for representing data on regular grids is introduced and studied. The main attraction of this new L-CAMP methodology is in the way it scales with th...
135
click to vote
MP
2008
15 years 5 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
162
click to vote
MST
2010
15 years 3 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...