Sciweavers

3758 search results - page 62 / 752
» A Complete Subsumption Algorithm
Sort
View
STACS
2010
Springer
14 years 2 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen
FPGA
1998
ACM
142views FPGA» more  FPGA 1998»
13 years 12 months ago
A Hybrid Complete-Graph Partial-Crossbar Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose
AGENTS
1997
Springer
13 years 12 months ago
High-Level Planning and Low-Level Execution: Towards a Complete Robotic Agent
We have been developing Rogue, an architecture that integrates high-level planning with a low-level executing robotic agent. Rogue is designed as the oce gofer task planner for X...
Karen Zita Haigh, Manuela M. Veloso
COR
2007
80views more  COR 2007»
13 years 7 months ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 5 months ago
Calibration for Ultrasound Breast Tomography Using Matrix Completion
We study the calibration problem in circular ultrasound tomography devices for breast imaging, where the sensor positions deviate from the circumference of a perfect circle. We in...
Reza Parhizkar, Amin Karbasi, Sewoong Oh, Martin V...