Sciweavers

5448 search results - page 211 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
RSS
2007
126views Robotics» more  RSS 2007»
15 years 5 months ago
Automatic Scheduling for Parallel Forward Dynamics Computation of Open Kinematic Chains
— Recent progress in the algorithm as well as the processor power have made the dynamics simulation of complex kinematic chains more realistic in various fields such as human mo...
Katsu Yamane, Yoshihiko Nakamura
COMPSAC
2011
IEEE
14 years 4 months ago
Dynamic Request Management Algorithms for Web-Based Services in Cloud Computing
—Providers of Web-based services can take advantage of many convenient features of cloud computing infrastructures, but they still have to implement request management algorithms...
Riccardo Lancellotti, Mauro Andreolini, Claudia Ca...
DIS
2007
Springer
15 years 10 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki
NCA
2006
IEEE
15 years 10 months ago
Trust Assessment from Observed Behavior: Toward and Essential Service for Trusted Network Computing
Modern distributed information systems handle increasingly critical data and computation, but there is no systematic way to assess whether a given part of the system can be entrus...
Partha Pratim Pal, Franklin Webber, Michael Atighe...
SIGECOM
2010
ACM
165views ECommerce» more  SIGECOM 2010»
15 years 9 months ago
Computing optimal strategies to commit to in extensive-form games
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
Joshua Letchford, Vincent Conitzer