Sciweavers

194 search results - page 14 / 39
» Gathering Algorithms on Paths Under Interference Constraints
Sort
View
MSWIM
2006
ACM
14 years 1 months ago
Interference-constrained wireless coverage in a protocol model
We present an efficient algorithm to compute the coverage map of a given set of transmitters under interference constraints. That is, we compute the set of points that lie within ...
Prateek R. Kapadia, Om P. Damani
NETWORKS
2007
13 years 7 months ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei
NDSS
2008
IEEE
14 years 2 months ago
Automated Whitebox Fuzz Testing
Fuzz testing is an effective technique for finding security vulnerabilities in software. Traditionally, fuzz testing tools apply random mutations to well-formed inputs of a progr...
Patrice Godefroid, Michael Y. Levin, David A. Moln...
INFOCOM
2007
IEEE
14 years 1 months ago
Joint Congestion Control and Distributed Scheduling for Throughput Guarantees in Wireless Networks
— We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a joint congestion control and scheduling algorithm that achieves a fraction d...
Gaurav Sharma, Ness B. Shroff, Ravi R. Mazumdar
ISCAS
2007
IEEE
138views Hardware» more  ISCAS 2007»
14 years 1 months ago
A Performance Driven Layout Compaction Optimization Algorithm for Analog Circuits
-- In interconnect-dominated designs, the ability to minimize layout-induced parasitic effects is crucial for rapid design closure. Deep sub-micron effects and ubiquitous interfere...
Henry H. Y. Chan, Zeljko Zilic