Sciweavers

23 search results - page 3 / 5
» dagstuhl 2000
Sort
View
DAGSTUHL
2000
13 years 6 months ago
Presenting Data from Experiments in Algorithmics
Algorithmic experiments yield large amounts of data that depends on many parameters. This paper collects a number of rules for presenting this data in concise, meaningful, understa...
Peter Sanders
DAGSTUHL
2000
13 years 6 months ago
On the Competitive Complexity of Navigation Tasks
A strategy S solving a navigation task T is called competitive with ratio r if the cost of solving any instance t of T does not exceed r times the cost of solving t optimally. The ...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
DAGSTUHL
2006
13 years 6 months ago
Techniques for Empirical Validation
In 1998 a survey was published on the extent to which software engineering papers validate the claims made in those papers. The survey looked at publications in 1985, 1990 and 1995...
Marvin V. Zelkowitz
DAGSTUHL
2006
13 years 6 months ago
Negotiation Fever: Loss Aversion in Multi-Issue Negotiations
Negotiating parties oftentimes do not reach mutually beneficial agreements. A considerable body of research on negotiation analysis compiled a set of so called common biases in ne...
Henner Gimpel
DAGSTUHL
2000
13 years 6 months ago
Product Form Queueing Networks
Queueing network models have been extensively applied to represent and analyze resource sharing systems such as communication and computer systems and they have proved to be a pow...
Simonetta Balsamo