Sciweavers

724 search results - page 53 / 145
» Discrete Rate Simulation using linear programming
Sort
View
MOBIHOC
2006
ACM
14 years 8 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
ISPASS
2007
IEEE
14 years 3 months ago
A Comparison of Two Approaches to Parallel Simulation of Multiprocessors
— The design trend towards CMPs has made the simulation of multiprocessor systems a necessity and has also made multiprocessor systems widely available. While a serial multiproce...
Andrew Over, Bill Clarke, Peter E. Strazdins
SAC
2008
ACM
13 years 8 months ago
Improving denial of service resistance using dynamic local adaptations
We improve the resistance of gossip-based multicast to (Distributed) Denial of Service (DoS) attacks using dynamic local adaptations at each node. Each node estimates the current ...
Gal Badishi, Idit Keidar
BMCBI
2007
152views more  BMCBI 2007»
13 years 9 months ago
Recodon: Coalescent simulation of coding DNA sequences with recombination, migration and demography
Background: Coalescent simulations have proven very useful in many population genetics studies. In order to arrive to meaningful conclusions, it is important that these simulation...
Miguel Arenas, David Posada
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
14 years 2 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert