3367 search results - page 267 / 674 » Incremental assignment problem |
144
click to vote
ICAISC
2010
Springer
15 years 6 months ago
2010
Springer
The problem of finding optimal locations of base stations, their pilot powers and channel assignments in UMTS mobile networks belongs to a class of NP-hard problems, and hence, me...
157
Voted
NIPS
2008
15 years 5 months ago
2008
Object matching is a fundamental operation in data analysis. It typically requires the definition of a similarity measure between the classes of objects to be matched. Instead, we...
111
click to vote
EUROPLOP
2006
15 years 5 months ago
2006
We present a set of methods to enable a cross-domain reuse of problem solutions via analysis patterns. First, problem-context descriptions and problemcontext models as well as sol...
145
Voted
IPL
2006
15 years 4 months ago
2006
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy c...
141
click to vote
ALGOSENSORS
2010
Springer
15 years 3 months ago
2010
Springer
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...