Sciweavers

301 search results - page 31 / 61
» Counting Models Using Connected Components
Sort
View
CORR
2000
Springer
96views Education» more  CORR 2000»
14 years 9 months ago
Robustness of Regional Matching Scheme over Global Matching Scheme
Analyzing the effect of concentrated noise on a typical decision-making process of a simplified two-candidate voting model, we have demonstrated that a local approach using a regi...
Liang Chen, Naoyuki Tokuda
EMSOFT
2005
Springer
15 years 3 months ago
Real-time interfaces for interface-based design of real-time systems with fixed priority scheduling
The central idea behind interface-based design is to describe components by a component interface. In contrast to a component description that describes what a component does, a c...
Ernesto Wandeler, Lothar Thiele
WAW
2007
Springer
157views Algorithms» more  WAW 2007»
15 years 3 months ago
Stochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
Mohammad Mahdian, Ying Xu 0002
NIPS
2001
14 years 11 months ago
TAP Gibbs Free Energy, Belief Propagation and Sparsity
The adaptive TAP Gibbs free energy for a general densely connected probabilistic model with quadratic interactions and arbritary single site constraints is derived. We show how a ...
Lehel Csató, Manfred Opper, Ole Winther
65
Voted
CORR
2007
Springer
99views Education» more  CORR 2007»
14 years 9 months ago
Regions of Feasible Point-to-Point Trajectories in the Cartesian Workspace of Fully-Parallel Manipulators
The goal of this paper is to define the n-connected regions in the Cartesian workspace of fully-parallel manipulators, i.e. the maximal regions where it is possible to execute po...
Damien Chablat, Philippe Wenger