Sciweavers

3885 search results - page 400 / 777
» Clarifying Goal Models
Sort
View
ATAL
2009
Springer
16 years 1 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
EUROCRYPT
2004
Springer
16 years 5 days ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
ICALP
2003
Springer
15 years 12 months ago
Algorithmic Aspects of Bandwidth Trading
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph ...
FOSSACS
1999
Springer
15 years 11 months ago
A Strong Logic Programming View for Static Embedded Implications
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
R. Arruabarrena, Paqui Lucio, Marisa Navarro
HIM
1997
Springer
144views Multimedia» more  HIM 1997»
15 years 11 months ago
DIANE - Hypermedia Documents in a Distributed Annotation Environment
The project DIANE is an EU-funded project in the ACTS Program and started in September 1995. The goal of DIANE is to establish a service, which enables an user to annotate anythin...
Hartmut Benz, Steffen Fischer, Rolf Mecklenburg, G...