Sciweavers

725 search results - page 97 / 145
» Bounding Degrees on RPL
Sort
View
AAIM
2007
Springer
151views Algorithms» more  AAIM 2007»
14 years 4 months ago
Acyclic Edge Colouring of Outerplanar Graphs
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
Rahul Muthu, N. Narayanan, C. R. Subramanian
MFCS
2007
Springer
14 years 4 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers
ROBIO
2006
IEEE
130views Robotics» more  ROBIO 2006»
14 years 3 months ago
GA-Based Multi-Objective Optimal Design of a Planar 3-DOF Cable-Driven Parallel Manipulator
— The architecture optimization of a three degrees of freedom (3-DOF) planar cable-driven parallel manipulator (CDPM) with multiple objectives has been implemented by means of GA...
Yangmin Li, Qingsong Xu
LCN
2005
IEEE
14 years 3 months ago
Secure Content Delivery using Key Composition
In this paper, we propose a novel framework for secure multicast on overlay networks. Our contributions are threefold: 1) a technique key composition is proposed to cope with the ...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Hann...
DCOSS
2005
Springer
14 years 3 months ago
Stably Computable Properties of Network Graphs
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
Dana Angluin, James Aspnes, Melody Chan, Michael J...