Sciweavers

4451 search results - page 122 / 891
» On Random Ordering Constraints
Sort
View
IROS
2007
IEEE
160views Robotics» more  IROS 2007»
15 years 10 months ago
Task constrained motion planning in robot joint space
— We explore global randomized joint space path planning for articulated robots that are subject to task space constraints. This paper describes a representation of constrained m...
Mike Stilman
CP
2003
Springer
15 years 9 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
DCC
2000
IEEE
15 years 9 months ago
Arithmetic Coding for Low Power Embedded System Design
We present a novel algorithm that assigns codes to instructions during instruction code compression in order to minimize bus-related bit-toggling and thus reducing power consumpti...
Haris Lekatsas, Wayne Wolf, Jörg Henkel
PERCOM
2010
ACM
15 years 6 months ago
Engineering energy-efficient target detection applications in Wireless Sensor Networks
This paper addresses the problem of engineering energy-efficient target detection applications using unattended Wireless Sensor Networks (WSNs) for long-lasting surveillance of are...
Paolo Medagliani, Jeremie Leguay, Vincent Gay, Mar...
DAM
2000
137views more  DAM 2000»
15 years 4 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...