Sciweavers

12052 search results - page 307 / 2411
» computer 2010
Sort
View
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
15 years 5 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
ICRA
2010
IEEE
194views Robotics» more  ICRA 2010»
15 years 4 months ago
Continuous collision detection for non-rigid contact computations using local advancement
Abstract— We present a novel algorithm to perform continuous collision detection(CCD) between non-rigid, deformable models using local advancement. Given the initial and final c...
Min Tang, Young J. Kim, Dinesh Manocha
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
15 years 4 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers
IJAR
2010
70views more  IJAR 2010»
15 years 4 months ago
Granular computing applied to ontologies
Granular Computing is an emerging conceptual and computing paradigm of information processing. A central notion is an information-processing pyramid with different levels of clari...
Silvia Calegari, Davide Ciucci
192
Voted
ITIIS
2010
150views more  ITIIS 2010»
15 years 4 months ago
Computational Trust and Its Impact over Rational Purchasing Decisions of Internet Users
As web-based online communities are rapidly growing, the agents in the communities need to know their measurable belief of trust for safe and successful interactions. In this pape...
Sanguk Noh