Sciweavers

1629 search results - page 128 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
15 years 3 months ago
PCG: a foothold selection algorithm for spider robot locomotion in 2D tunnels
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
Amir Shapiro, Elon Rimon
TPDS
2008
117views more  TPDS 2008»
14 years 10 months ago
Energy-Efficient Thermal-Aware Task Scheduling for Homogeneous High-Performance Computing Data Centers: A Cyber-Physical Approac
High Performance Computing data centers have been rapidly growing, both in number and size. Thermal management of data centers can address dominant problems associated with cooling...
Qinghui Tang, Sandeep K. S. Gupta, Georgios Varsam...
ICASSP
2010
IEEE
14 years 10 months ago
Efficient weighted-sum-rate maximization for a class of half-duplex cooperative systems
In many half-duplex cooperative systems, the direct formulation of the problem of finding the jointly optimal power and channel resource allocation that maximizes a weighted sum ...
Wessam Mesbah, Timothy N. Davidson
SBCCI
2003
ACM
213views VLSI» more  SBCCI 2003»
15 years 3 months ago
Algorithms and Tools for Network on Chip Based System Design
Network on Chip (NoC) is a new paradigm for designing core based System on Chips. It supports high degree of reusability and is scalable. In this paper, an efficient Two-Step Gene...
Tang Lei, Shashi Kumar
JETAI
2008
93views more  JETAI 2008»
14 years 10 months ago
The message management asynchronous backtracking algorithm
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
Hong Jiang, José M. Vidal