Sciweavers

343 search results - page 25 / 69
» Purely Relational FLWORs
Sort
View
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 7 months ago
XQuery Join Graph Isolation
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
Torsten Grust, Manuel Mayr, Jan Rittinger
EPIA
2007
Springer
14 years 1 months ago
Convergence of Independent Adaptive Learners
In this paper we analyze the convergence of independent adaptive learners in repeated games. We show that, in this class of games, independent adaptive learners converge to pure Na...
Francisco S. Melo, Manuel C. Lopes
FSEN
2007
Springer
14 years 1 months ago
Logical Bisimulations and Functional Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimul...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
ISAAC
2005
Springer
104views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Network Load Games
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 2 months ago
Kron Reduction of Graphs with Applications to Electrical Networks
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
Florian Dörfler, Francesco Bullo