Sciweavers

260 search results - page 11 / 52
» Range and Set Abstraction using SAT
Sort
View
ICS
2009
Tsinghua U.
14 years 3 days ago
Dynamic task set partitioning based on balancing memory requirements to reduce power consumption
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...
DAC
2006
ACM
14 years 8 months ago
Predicate learning and selective theory deduction for a difference logic solver
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
Chao Wang, Aarti Gupta, Malay K. Ganai
NIPS
2008
13 years 9 months ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
ISER
1999
Springer
84views Robotics» more  ISER 1999»
13 years 11 months ago
Preliminary Results on the use of Stereo, Color Cameras and Laser Sensors in Antarctica
Abstract: In November of 1998, an expedition from Carnegie Mellon University travelled to the Patriot Hills, Antarctica. The purpose of the expedition was to demonstrate autonomous...
Nicolas Vandapel, Stewart J. Moorehead, William Wh...
SAT
2007
Springer
118views Hardware» more  SAT 2007»
14 years 1 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov