6110 search results - page 927 / 1222 » Approximate Computing |
241
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
186
click to vote
NETWORKS
2010
15 years 5 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
169
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We present and analyse the behaviour of specialised operators designed for cooperative coevolution strategy in the framework of 3D tomographic PET reconstruction. The bas...
180
click to vote
QUESTA
2010
15 years 5 months ago
2010
Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous servi...
153
click to vote
SIGOPS
2010
15 years 5 months ago
2010
We describe the design of, and experience with, Query, a monitoring system that supports the Akamai EdgePlatform. Query is a foundation of Akamai’s approach to administering its...