Sciweavers

914 search results - page 26 / 183
» Branch and Bound on the Network Model
Sort
View
DSN
2004
IEEE
15 years 1 months ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
WASA
2009
Springer
165views Algorithms» more  WASA 2009»
15 years 4 months ago
Maximum Independent Set of Links under Physical Interference Model
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...
Peng-Jun Wan, Xiaohua Jia, F. Frances Yao
IPSN
2005
Springer
15 years 3 months ago
The sensor selection problem for bounded uncertainty sensing models
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
Volkan Isler, Ruzena Bajcsy
CORR
2011
Springer
170views Education» more  CORR 2011»
14 years 4 months ago
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain nu...
Marek Chrobak, Lukasz Jez, Jiri Sgall
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
14 years 11 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...