Sciweavers

15073 search results - page 2657 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
DAC
2003
ACM
15 years 9 months ago
Force directed mongrel with physical net constraints
This paper describes a new force directed global placement algorithm that exploits and extends techniques from two leading placers, Force-directed [12] [26] and Mongrel [22]. It c...
Sung-Woo Hur, Tung Cao, Karthik Rajagopal, Yegna P...
ICALP
2003
Springer
15 years 9 months ago
Anycasting in Adversarial Systems: Routing and Admission Control
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
Baruch Awerbuch, André Brinkmann, Christian...
137
Voted
AINA
2010
IEEE
15 years 9 months ago
A Fully Dynamic and Self-Stabilizing TDMA Scheme for Wireless Ad-hoc Networks
One important challenge in wireless ad hoc networks is to achieve collision free communication. Many MAC layer protocols have been proposed by considering various communication mod...
Bezawada Bruhadeshwar, Kishore Kothapalli, Indira ...
135
Voted
ICDCS
1999
IEEE
15 years 9 months ago
Incorporating Transaction Semantics to Reduce Reprocessing Overhead in Replicated Mobile Data Applications
Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up. To reduce this problem, a two-tier replication algorithm is proposed in [...
Peng Liu, Paul Ammann, Sushil Jajodia
131
Voted
ACSAC
2009
IEEE
15 years 8 months ago
A Network Access Control Mechanism Based on Behavior Profiles
Abstract--Current Network Access Control (NAC) technologies manage the access of new devices into a network to prevent rogue devices from attacking network hosts or services. Typic...
Vanessa Frías-Martínez, Joseph Sherr...
« Prev « First page 2657 / 3015 Last » Next »