Sciweavers

1945 search results - page 226 / 389
» Pursuit-Evasion in Models of Complex Networks
Sort
View
CN
2006
106views more  CN 2006»
13 years 8 months ago
Efficient large-scale BGP simulations
Simulation has been the method of choice for analyzing large, complex, and highly volatile systems. One of these systems is the inter-domain routing infrastructure of the Internet...
Xenofontas A. Dimitropoulos, George F. Riley
COMSWARE
2007
IEEE
14 years 2 months ago
Situation-Aware Software Engineering for Sensor Networks
—Sensor networks represent a new frontier in technology that holds the promise of unprecedented levels of autonomy in the execution of complex dynamic missions by harnessing the ...
Vir V. Phoha, Shashi Phoha
AVI
2008
13 years 10 months ago
Agent warp engine: formula based shape warping for networked applications
Computer visualization and networking have advanced dramatically over the last few years, partially driven by the exploding video game market. 3D hardware acceleration has reached...
Alexander Repenning, Andri Ioannidou
WINE
2009
Springer
184views Economy» more  WINE 2009»
14 years 2 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...
ANCS
2007
ACM
14 years 11 days ago
Optimal packet scheduling in output-buffered optical switches with limited-range wavelength conversion
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
Lin Liu, Yuanyuan Yang