Sciweavers

6562 search results - page 179 / 1313
» Noetherianity and Combination Problems
Sort
View
ICRA
1993
IEEE
88views Robotics» more  ICRA 1993»
15 years 10 months ago
On the Form-Closure of Polygonal Objects with Frictional and Frictionless Contact Models
This paper investigates the problem of "formclosure"for three-fingered grasps of polygonal objects under various combinations of contact models at the contact points. We...
Yu-Che Chen, Jeffrey C. Trinkle
ESANN
2008
15 years 8 months ago
An emphasized target smoothing procedure to improve MLP classifiers performance
Standard learning procedures are better fitted to estimation than to classification problems, and focusing the training on appropriate samples provides performance advantages in cl...
Soufiane El Jelali, Abdelouahid Lyhyaoui, An&iacut...
FROCOS
2007
Springer
16 years 19 days ago
Towards an Automatic Analysis of Web Service Security
Web services send and receive messages in XML syntax with some parts hashed, encrypted or signed, according to the WS-Security standard. In this paper we introduce a model to forma...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
ICDM
2006
IEEE
76views Data Mining» more  ICDM 2006»
16 years 15 days ago
A Probabilistic Ensemble Pruning Algorithm
An ensemble is a group of learners that work together as a committee to solve a problem. However, the existing ensemble training algorithms sometimes generate unnecessary large en...
Huanhuan Chen, Peter Tiño, Xin Yao
ACST
2006
15 years 7 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara