Sciweavers

2372 search results - page 472 / 475
» Probabilistic calling context
Sort
View
CAE
2010
13 years 2 months ago
Stroke Matching for Paint Dances
We have implemented a non-photorealistic rendering system which simulates the placement of paint/pencil/pastel strokes to produce representational artworks from digital images. Th...
Simon Colton
JNSM
2010
166views more  JNSM 2010»
13 years 2 months ago
High-Level Design Approach for the Specification of Cognitive Radio Equipments Management APIs
Cognitive Radio (CR) equipments are radio devices that support the smart facilities offered by future cognitive networks. Even if several categories of equipments exist (terminal,...
Christophe Moy
SIAMIS
2010
141views more  SIAMIS 2010»
13 years 2 months ago
Optimization by Stochastic Continuation
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Marc C. Robini, Isabelle E. Magnin
SOICT
2010
13 years 2 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
TNN
2010
176views Management» more  TNN 2010»
13 years 2 months ago
On the weight convergence of Elman networks
Abstract--An Elman network (EN) can be viewed as a feedforward (FF) neural network with an additional set of inputs from the context layer (feedback from the hidden layer). Therefo...
Qing Song