Sciweavers

359 search results - page 38 / 72
» On Complete Primitives for Fairness
Sort
View
90
Voted
CNIS
2006
15 years 2 months ago
Design of a virtual computer security lab
We present the design and a prototype of a lab course on computer security, the necessity of which arises from the students' need to complement course work by hands-on experi...
Jörg Keller, Ralf Naues
RIAO
2000
15 years 2 months ago
SgmlQL + XGQL = Powerful XML Pattern-Matching and Data-Manipulation in a Single Language
The presence of XML in many recent hypermedia management tools and methods (W3I3, SMIL, etc.) shows better than ever that both structural and textual criteria will continue to pla...
Jacques Le Maitre, Yves Marcoux, Elisabeth Murisas...
102
Voted
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 24 days ago
Optimal Partitions in Additively Separable Hedonic Games
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partiti...
Haris Aziz, Felix Brandt, Hans Georg Seedig
82
Voted
JAPLL
2006
109views more  JAPLL 2006»
15 years 20 days ago
Deduction chains for common knowledge
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
Mathis Kretz, Thomas Studer
87
Voted
TELSYS
2002
120views more  TELSYS 2002»
15 years 10 days ago
A Receiver-Driven Transport Protocol for the Web
Abstract. In this paper, we present a receiver-oriented, request/response protocol for the Web that is compatible with the dynamics of TCP's congestion control algorithm. The ...
Rajarshi Gupta, Mike Y. Chen, Steven McCanne, Jean...