Sciweavers

8377 search results - page 1622 / 1676
» Scenarios - Introduction
Sort
View
HEURISTICS
2000
127views more  HEURISTICS 2000»
14 years 11 months ago
Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the p...
Joel W. Gannett
JSS
2000
85views more  JSS 2000»
14 years 11 months ago
An experimental comparison of reading techniques for defect detection in UML design documents
The basic motivation for software inspections is to detect and remove defects before they propagate to subsequent development phases where their detection and removal becomes more...
Oliver Laitenberger, Colin Atkinson, Maud Schlich,...
MISQ
2000
104views more  MISQ 2000»
14 years 11 months ago
Understanding Computer-Mediated Discussions: Positivist and Interpretive Analyses of Group Support System Use
This research considers whether interpretive techniques can be used to enhance our understanding of computer-mediated discussions. The case study considered in this research is th...
Eileen M. Trauth, Leonard M. Jessup
MST
2000
57views more  MST 2000»
14 years 11 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
SIAMCOMP
2000
79views more  SIAMCOMP 2000»
14 years 11 months ago
Optimal Worst Case Formulas Comparing Cache Memory Associativity
ct Consider an arbitrary program P which is to be executed on a computer with two alternative cache memories. The rst cache has k sets and u blocks in each set, this is denoted a ...
Håkan Lennerstad, Lars Lundberg
« Prev « First page 1622 / 1676 Last » Next »