Sciweavers

3941 search results - page 517 / 789
» Computational Efficiency of Batching Methods
Sort
View
CGF
2002
107views more  CGF 2002»
15 years 11 days ago
STRANDS: Interactive Simulation of Thin Solids using Cosserat Models
STRANDS are thin elastic solids that are visually well approximated as smooth curves, and yet possess essential physical behaviors characteristic of solid objects such as twisting...
Dinesh K. Pai
JHSN
2000
172views more  JHSN 2000»
15 years 10 days ago
Dynamic token bucket (DTB): a fair bandwidth allocation algorithm for high-speed networks
Fair allocation of available bandwidth to competing flows is a simple form of quality of service (QoS) that can be provided to customers in packet-switched networks. A number of p...
Jayakrishna Kidambi, Dipak Ghosal, Biswanath Mukhe...
113
Voted
GEOINFORMATICA
2002
136views more  GEOINFORMATICA 2002»
15 years 10 days ago
Tabu Search Heuristic for Point-Feature Cartographic Label Placement
The generation of better label placement configurations in maps is a problem that comes up in automated cartographic production. The objective of a good label placement is to displ...
Missae Yamamoto, Gilberto Câmara, Luiz Anton...
86
Voted
NN
1998
Springer
15 years 6 days ago
Statistical estimation of the number of hidden units for feedforward neural networks
The number of required hidden units is statistically estimated for feedforward neural networks that are constructed by adding hidden units one by one. The output error decreases w...
Osamu Fujita
141
Voted
TIM
2010
144views Education» more  TIM 2010»
14 years 7 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta