Sciweavers

1857 search results - page 38 / 372
» Minimum Degree Orderings
Sort
View
ICRA
2006
IEEE
130views Robotics» more  ICRA 2006»
14 years 4 months ago
Study on Hemispherical Soft-fingered Handling for fine Manipulation by Minimum D.O.F. Robotic Hand
— This paper provides that an elastic force and an elastic potential energy due to the deformation of soft fingers, which are previously derived, can be calculated into straight...
Takahiro Inoue, Shinichi Hirai
ATAL
2004
Springer
14 years 4 months ago
Degree of Local Cooperation and Its Implication on Global Utility
In a cooperative multi-agent system that is situated in an evolving environment, agents need to dynamically adjust their negotiation attitudes towards different agents in order to...
Jiaying Shen, Xiaoqin Zhang, Victor R. Lesser
MOC
1998
98views more  MOC 1998»
13 years 10 months ago
Distribution of irreducible polynomials of small degrees over finite fields
D. Wan very recently proved an asymptotic version of a conjecture of Hansen and Mullen concerning the distribution of irreducible polynomials over finite fields. In this note we ...
Kie H. Ham, Gary L. Mullen
MOBIHOC
2002
ACM
14 years 10 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 9 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer