Sciweavers

914 search results - page 123 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
IACR
2011
128views more  IACR 2011»
12 years 8 months ago
Sign Modules in Secure Arithmetic Circuits
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
Ching-Hua Yu
ATAL
2005
Springer
14 years 2 months ago
A polynomial algorithm for decentralized Markov decision processes with temporal constraints
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
Aurélie Beynier, Abdel-Illah Mouaddib
ACE
2003
180views Education» more  ACE 2003»
13 years 10 months ago
Managing the managers: Collaborative virtual teams with large staff and student numbers
Virtual teaming involving online presentations and peer reviews support the notion of collaborative student learning, whilst preparing them for the virtual work environment. Howev...
Kathy Egea
MICCAI
2002
Springer
14 years 9 months ago
Needle Insertion Modelling for the Interactive Simulation of Percutaneous Procedures
Abstract. A novel interactive virtual needle insertion simulation is presented. The insertion model simulates three-degree-of-freedom needle motion, physically-based needle forces,...
Simon P. DiMaio, S. E. Salcudean
ICTAI
2008
IEEE
14 years 3 months ago
Automatic Design of Robot Behaviors through Constraint Network Acquisition
Control architectures, such as the LAAS architecture [1], CLARATY [12] and HARPIC [9], have been developped to provide autonomy to robots. To achieve a robot’s task, these contr...
Mathias Paulin, Christian Bessiere, Jean Sallantin