1053 search results - page 6 / 211 » On k-Path Covers and their applications |
OTM
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Even though the semantic web become actual topic of research recently, there are no complex solutions for building semantic applications yet to our best knowledge. We des...
IPL
2008
13 years 8 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
HICSS
2009
IEEE
14 years 3 months ago
2009
IEEE
Suppose there are n applications and n processors. A pair cover is a set S of one-to-one mappings (assignments) of the applications to the processors such that, for every pair (Ai...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
ISF
2008
13 years 8 months ago
2008
In this study, a mathematical model is suggested concerning the location of VHF/UHF frequency radio jammer systems to the terrain parts to conduct single frequency or sequential fr...