4255 search results - page 111 / 851 » Cover |
130
Voted
FSTTCS
2010
Springer
15 years 18 days ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
115
Voted
KDD
2009
ACM
15 years 9 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
122
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
111
Voted
MOR
2002
15 years 2 months ago
2002
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
98
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— Unlike convectional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may have a limited angle of sensing range due to technical con...