Sciweavers

146 search results - page 10 / 30
» cn 2006
Sort
View
JALC
2006
90views more  JALC 2006»
14 years 9 months ago
Generating all Circular Shifts by Context-Free Grammars in Chomsky Normal Form
-- Let {a1, a2, . . . , an} be an alphabet of n symbols and let Cn be the language of circular shifts of the word a1a2
Peter R. J. Asveld
CN
2007
64views more  CN 2007»
14 years 9 months ago
A taxonomy for identifying requirement interactions in software systems
This paper presents an interaction taxonomy for classifying and identifying requirement interactions in software systems. The proposed taxonomy is in the form of a four-layered py...
Mohamed Shehata, Armin Eberlein, Abraham O. Fapoju...
CN
2007
99views more  CN 2007»
14 years 9 months ago
Reducing the cost of applying adaptive test cases
The testing of a state-based system may involve the application of a number of adaptive test cases. Where the implementation under test (IUT) is deterministic, the response of the...
Robert M. Hierons, Hasan Ural
CN
2007
93views more  CN 2007»
14 years 9 months ago
Why TCP timers (still) don't work well
We argue that the design principles of the TCP timeout algorithm are based solely on RTT estimations and may lead to flow synchronization, unnecessary retransmission effort and ...
Ioannis Psaras, Vassilis Tsaoussidis
CN
2007
104views more  CN 2007»
14 years 9 months ago
Performance analysis of the AntNet algorithm
A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of a...
S. S. Dhillon, Piet Van Mieghem