Sciweavers

8825 search results - page 1552 / 1765
» All for one or one for all
Sort
View
JPDC
2007
117views more  JPDC 2007»
15 years 21 days ago
Adversarial exploits of end-systems adaptation dynamics
Internet end-systems employ various adaptation mechanisms that enable them to respond adequately to legitimate requests in overload situations. Today, these mechanisms are incorpo...
Mina Guirguis, Azer Bestavros, Ibrahim Matta, Yuti...
ADHOC
2004
118views more  ADHOC 2004»
15 years 21 days ago
A review of routing protocols for mobile ad hoc networks
The 1990s have seen a rapid growth of research interests in mobile ad hoc networking. The infrastructureless and the dynamic nature of these networks demands new set of networking...
Mehran Abolhasan, Tadeusz A. Wysocki, Eryk Dutkiew...
JSS
2007
118views more  JSS 2007»
15 years 21 days ago
A new imputation method for small software project data sets
Effort prediction is a very important issue for software project management. Historical project data sets are frequently used to support such prediction. But missing data are oft...
Qinbao Song, Martin J. Shepperd
JSS
2007
126views more  JSS 2007»
15 years 21 days ago
Fine-grain analysis of common coupling and its application to a Linux case study
Common coupling (sharing global variables across modules) is widely accepted as a measure of software quality and maintainability; a low level of common coupling is necessary (but...
Dror G. Feitelson, Tokunbo O. S. Adeshiyan, Daniel...
118
Voted
JSYML
2007
100views more  JSYML 2007»
15 years 21 days ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
« Prev « First page 1552 / 1765 Last » Next »