Sciweavers

7839 search results - page 1481 / 1568
» What's News, What's Not
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 10 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
DC
2010
13 years 10 months ago
A knowledge-based analysis of global function computation
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
Joseph Y. Halpern, Sabina Petride
DAM
2008
114views more  DAM 2008»
13 years 10 months ago
Efficient solutions to the braid isotopy problem
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
Patrick Dehornoy
DEBU
2008
125views more  DEBU 2008»
13 years 10 months ago
Querying XML in Timber
In this paper, we describe the TIMBER XML database system implemented at University of Michigan. TIMBER was one of the first native XML database systems, designed from the ground ...
Yuqing Wu, Stelios Paparizos, H. V. Jagadish
AI
2006
Springer
13 years 10 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
« Prev « First page 1481 / 1568 Last » Next »