Sciweavers

3625 search results - page 321 / 725
» On Timed Models of Gene Networks
Sort
View
TON
2008
74views more  TON 2008»
15 years 6 months ago
Race conditions in coexisting overlay networks
By allowing end hosts to make independent routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes...
Ram Keralapura, Chen-Nee Chuah, Nina Taft, Gianluc...
INFOCOM
2008
IEEE
16 years 1 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
EOR
2010
87views more  EOR 2010»
15 years 6 months ago
On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks
-- The classical Wardrop System Optimum (SO) assignment model assumes that the users will cooperate with each other in order to minimize the overall travel costs. The importance of...
Frederico R. B. Cruz, Tom Van Woensel, James MacGr...
WSC
2000
15 years 8 months ago
Predicting enemy force closure with simulation
This paper presents a model and an analysis done to predict enemy force closure. The simulation replaces a pencil and ruler method that has been used by Department of Defense plan...
Mark R. Grabau, Michael D. Payne
CP
2006
Springer
15 years 10 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter