Sciweavers

8810 search results - page 1500 / 1762
» Openness
Sort
View
LICS
2009
IEEE
16 years 1 months ago
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
Michele Basaldella, Claudia Faggian
AMT
2009
Springer
263views Multimedia» more  AMT 2009»
16 years 1 months ago
A Dynamic Trust Network for Autonomy-Oriented Partner Finding
The problem of partner finding is to identify which entities (agents) can provide requested services from a group of entities. It can be found in open and distributed environment...
Hongjun Qiu, Jiming Liu, Ning Zhong
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
16 years 1 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
WADS
2009
Springer
232views Algorithms» more  WADS 2009»
16 years 1 months ago
On Making Directed Graphs Transitive
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...
WASA
2009
Springer
141views Algorithms» more  WASA 2009»
16 years 1 months ago
Design and Implementation of Davis Social Links OSN Kernel
Social network popularity continues to rise as they broaden out to more users. Hidden away within these social networks is a valuable set of data that outlines everyone’s relatio...
Thomas Tran, Kelcey Chan, Shaozhi Ye, Prantik Bhat...
« Prev « First page 1500 / 1762 Last » Next »