Sciweavers

662 search results - page 74 / 133
» Formalizing Basic First Order Model Theory
Sort
View
WWW
2004
ACM
14 years 8 months ago
Information diffusion through blogspace
We study the dynamics of information propagation in environments of low-overhead personal publishing, using a large collection of weblogs over time as our example domain. We chara...
Daniel Gruhl, Ramanathan V. Guha, David Liben-Nowe...
AI
2000
Springer
13 years 7 months ago
Boolean connection algebras: A new approach to the Region-Connection Calculus
The Region-Connection Calculus (RCC) is a well established formal system for qualitative spatial reasoning. It provides an axiomatization of space which takes regions as primitive...
John G. Stell
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
13 years 9 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
AIMSA
2000
Springer
14 years 1 days ago
Least Generalization under Relative Implication
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
Svetla Boytcheva
ICALP
1989
Springer
13 years 11 months ago
Causal Trees
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Philippe Darondeau, Pierpaolo Degano