Sciweavers

1805 search results - page 292 / 361
» A Theory of Closure Operators
Sort
View
ADVCS
2008
140views more  ADVCS 2008»
15 years 4 months ago
Reputation for Innovating Social Networks
Reputation is a fundamental instrument of partner selection. Developed within the domain of electronic auctions, reputation technology is being been imported into other applicatio...
Rosaria Conte, Mario Paolucci, Jordi Sabater-Mir
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 4 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 4 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
CORR
2008
Springer
137views Education» more  CORR 2008»
15 years 4 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
DAM
2008
84views more  DAM 2008»
15 years 4 months ago
Edge-splittings preserving local edge-connectivity of graphs
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
Zoltán Szigeti