Sciweavers

2128 search results - page 189 / 426
» A general characterization of indulgence
Sort
View
AIPS
2010
15 years 9 months ago
Computing Applicability Conditions for Plans with Loops
The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representat...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
CIKM
2008
Springer
15 years 8 months ago
Social capital in online communities
Online communities are connecting hordes of individuals and generating rich social network data. The social capital that resides within these networks is largely unknown. We propo...
Matthew S. Smith
AINA
2006
IEEE
15 years 8 months ago
Resources availability for Peer to Peer systems
Nowadays, Peer to Peer systems are largely studied. But in order to evaluate them in a realistic way, a better knowledge of their environments is needed. In this article we focus o...
Georges Da Costa, Corine Marchand, Olivier Richard...
COMPGEOM
2005
ACM
15 years 8 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
15 years 8 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner