Sciweavers

3656 search results - page 259 / 732
» Compact Location Problems
Sort
View
ETS
2011
IEEE
230views Hardware» more  ETS 2011»
14 years 6 months ago
Dynamic Test Set Selection Using Implication-Based On-Chip Diagnosis
—As circuits continue to scale to smaller feature sizes, wearout and latent defects are expected to cause an increasing number of errors in the field. Online error detection tec...
Nuno Alves, Y. Shi, N. Imbriglia, Jennifer Dworak,...
CVPR
2006
IEEE
16 years 8 months ago
Homography from Coplanar Ellipses with Application to Forensic Blood Splatter Reconstruction
Reconstruction of the point source of blood splatter in a crime scene is an important and difficult problem in forensic science. We study the problem of automatically reconstructi...
John Wright, Andrew Wagner, Shankar Rao, Yi Ma
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
16 years 6 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
ICRA
2008
IEEE
140views Robotics» more  ICRA 2008»
16 years 28 days ago
Multi-robot routing under limited communication range
Abstract— Teams of mobile robots have been recently proposed as effective means of completing complex missions involving multiple tasks spatially distributed over a large area. A...
Alejandro R. Mosteo, Luis Montano, Michail G. Lago...
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
16 years 20 days ago
Pricing Tree Access Networks with Connected Backbones
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. R...