Sciweavers

86 search results - page 1 / 18
» The Computational Complexity of the Minimum Weight Processor...
Sort
View
WG
2004
Springer
13 years 10 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
STACS
2001
Springer
13 years 9 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
STACS
2010
Springer
13 years 9 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
IWPEC
2004
Springer
13 years 10 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
13 years 11 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen