1298 search results - page 141 / 260 » The online set cover problem |
175
click to vote
NETWORKING
2007
15 years 8 months ago
2007
We consider event dependent routing algorithms for on-line explicit source routing in MPLS networks. The proposed methods are based on load shared sequential routing in which load ...
209
click to vote
ACL
2011
14 years 10 months ago
2011
Disambiguating concepts and entities in a context sensitive way is a fundamental problem in natural language processing. The comprehensiveness of Wikipedia has made the online enc...
193
click to vote
TCS
2010
15 years 4 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
141
click to vote
DIS
2009
Springer
16 years 1 months ago
2009
Springer
The promotion analysis problem has been proposed in [16], where ranking-based promotion query processing techniques are studied to effectively and efficiently promote a given obje...
157
click to vote
IJBRA
2008
15 years 6 months ago
2008
Abstract Observing behaviors of protein pathways and genetic networks under various environments in living cells is essential for unraveling disease and developing drugs. For that ...