Sciweavers

9405 search results - page 1354 / 1881
» Computing a Model of Set Theory
Sort
View
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
16 years 1 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
ICNP
2005
IEEE
16 years 19 days ago
Can coexisting overlays inadvertently step on each other?
By allowing end hosts to make routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes how multip...
Ram Keralapura, Chen-Nee Chuah, Nina Taft, Gianluc...
PADS
2005
ACM
16 years 18 days ago
Performance Benchmark of a Parallel and Distributed Network Simulator
Simulation of large-scale networks requires enormous amounts of memory and processing time. One way of speeding up these simulations is to distribute the model over a number of co...
Samson Lee, John Leaney, Tim O'Neill, Mark Hunter
AIED
2005
Springer
16 years 17 days ago
Tradeoff analysis between knowledge assessment approaches
Abstract: The problem of modeling and assessing an individual’s ability level is central to learning environments. Numerous approaches exists to this end. Computer Adaptive Testi...
Michel Desmarais, Shunkai Fu, Xiaoming Pu
ATAL
2005
Springer
16 years 17 days ago
Fuzzy number approach to trust in coalition environment
General trust management model that we present is adapted for ad-hoc coalition environment, rather than for classic client-supplier relationship. The trust representation used in ...
Martin Rehák, Michal Pechoucek, Petr Benda
« Prev « First page 1354 / 1881 Last » Next »