9325 search results - page 405 / 1865 » The decentralized implementability problem |
149
click to vote
HEURISTICS
2002
15 years 4 months ago
2002
We present a cooperative parallel tabu search method for the fixed charge, capacitated, multicommodity network design problem. Several communication strategies are analyzed and co...
144
click to vote
SAC
2008
ACM
15 years 4 months ago
2008
ACM
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...
147
Voted
CAP
2010
14 years 12 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
186
click to vote
TSP
2010
14 years 11 months ago
2010
We present two simple methods for recovering sparse signals from a series of noisy observations. The theory of compressed sensing (CS) requires solving a convex constrained minimiz...
206
click to vote
PEPM
2011
ACM
14 years 7 months ago
2011
ACM
The performance of many dynamic language implementations suffers from high allocation rates and runtime type checks. This makes dynamic languages less applicable to purely algorit...