Sciweavers

663 search results - page 96 / 133
» Algorithms for Computing Minimal Unsatisfiable Subsets of Co...
Sort
View
ATS
2001
IEEE
137views Hardware» more  ATS 2001»
13 years 11 months ago
Compaction Schemes with Minimum Test Application Time
Testing embedded cores in a System-on-a-chip necessitates the use of a Test Access Mechanism, which provides for transportation of the test data between the chip and the core I/Os...
Ozgur Sinanoglu, Alex Orailoglu
RAS
2007
115views more  RAS 2007»
13 years 7 months ago
A variational method for the recovery of dense 3D structure from motion
The purpose of this study is to investigate a variational formulation of the problem of three-dimensional (3D) interpretation of temporal image sequences based on the 3D brightnes...
Hicham Sekkati, Amar Mitiche
IROS
2009
IEEE
192views Robotics» more  IROS 2009»
14 years 2 months ago
Kinodynamic motion planning for mobile robots using splines
— This paper presents an approach to time-optimal kinodynamic motion planning for a mobile robot. A global path planner is used to generate collision-free straight-line paths fro...
Boris Lau, Christoph Sprunk, Wolfram Burgard
IPPS
2010
IEEE
13 years 5 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
MP
2010
119views more  MP 2010»
13 years 6 months ago
Efficient and fair routing for mesh networks
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...
Andrea Lodi, Enrico Malaguti, Nicolás E. St...