Sciweavers

3406 search results - page 602 / 682
» Computational models of classical conditioning
Sort
View
VSTTE
2005
Springer
14 years 3 months ago
From the How to the What
In this paper, we consider the Grand Challenge under a very specific perspective: the enabling of application experts without programming knowledge to reliably model their busines...
Tiziana Margaria, Bernhard Steffen
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
14 years 3 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
RT
2004
Springer
14 years 3 months ago
PointWorks: Abstraction and Rendering of Sparsely Scanned Outdoor Environments
ks: Abstraction and Rendering of Sparsely Scanned Outdoor Environments Hui Xu, Nathan Gossett and Baoquan Chen University of Minnesota Digital Technology Center at Twin Cities † ...
Hui Xu, Nathan Gossett, Baoquan Chen
GMP
2002
IEEE
172views Solid Modeling» more  GMP 2002»
14 years 2 months ago
Classifying the Nonsingular Intersection Curve of Two Quadric Surfaces
We present new results on classifying the morphology of the nonsingular intersection curve of two quadrics by studying the roots of the characteristic equation, or the discriminan...
Changhe Tu, Wenping Wang, Jiaye Wang
EVOW
2007
Springer
14 years 1 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...