Sciweavers

1279 search results - page 195 / 256
» Fast Implementations of Automata Computations
Sort
View
CCGRID
2008
IEEE
14 years 4 months ago
Pastel: Bridging the Gap between Structured and Large-State Overlays
Peer-to-peer overlays envision a single overlay substrate that can be used (possibly simultaneously) by many applications, but current overlays either target fast, few-hop lookups...
Nuno Cruces, Rodrigo Rodrigues, Paulo Ferreira
ICPP
2008
IEEE
14 years 4 months ago
Scalable Techniques for Transparent Privatization in Software Transactional Memory
—We address the recently recognized privatization problem in software transactional memory (STM) runtimes, and introduce the notion of partially visible reads (PVRs) to heuristic...
Virendra J. Marathe, Michael F. Spear, Michael L. ...
ADHOCNOW
2008
Springer
14 years 4 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...
ICNSC
2007
IEEE
14 years 4 months ago
Queue Length Based Internet Congestion Control
— In this paper we present new queue length based Internet congestion control protocol which is shown through simulations to work effectively. The control objective is to regulat...
Marios Lestas, Andreas Pitsillides, Petros A. Ioan...
IPPS
2007
IEEE
14 years 3 months ago
Tera-scalable Fourier Spectral Element Code for DNS of Channel Turbulent Flow at High Reynolds Number
Due to the extensive requirement of memory and speed for direct numerical simulation (DNS) of channel turbulence, people can only perform DNS at moderate Reynolds number before. W...
Jin Xu