1298 search results - page 30 / 260 » The online set cover problem |
114
click to vote
COCOA
2009
Springer
15 years 1 months ago
2009
Springer
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
ORL
2007
14 years 9 months ago
2007
We analyze a simple and natural on-line algorithm (dispatch policy) for a dynamic multiperiod uncapacitated routing problem, in which at the beginning of each time period a set of...
142
click to vote
MFCS
2010
Springer
14 years 8 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...
DCOSS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...