Sciweavers

3678 search results - page 492 / 736
» On the Stable Paths Problem
Sort
View
IIE
2007
159views more  IIE 2007»
15 years 4 months ago
Creating and Visualizing Test Data from Programming Exercises
Automatic assessment of programming exercises is typically based on testing approach. Most automatic assessment frameworks execute tests and evaluate test results automatically, bu...
Petri Ihantola
TDSC
2008
121views more  TDSC 2008»
15 years 4 months ago
Multipath Key Establishment for Wireless Sensor Networks Using Just-Enough Redundancy Transmission
In random key predistribution techniques for wireless sensor networks, a relatively small number of keys are randomly chosen from a large key pool and are loaded on the sensors pri...
Jing Deng, Yunghsiang S. Han
BELL
2000
107views more  BELL 2000»
15 years 4 months ago
Automating software feature verification
A significant part of the call processing software for Lucent's new PathStar access server [FSW98] was checked with automated formal verification techniques. The verification...
Gerard J. Holzmann, Margaret H. Smith
TON
1998
145views more  TON 1998»
15 years 4 months ago
Adaptive wavelength routing in all-optical networks
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
Ahmed Mokhtar, Murat Azizoglu
141
Voted
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 3 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase