Sciweavers

9477 search results - page 1475 / 1896
» Design is as Easy as Optimization
Sort
View
EMSOFT
2011
Springer
14 years 6 months ago
From boolean to quantitative synthesis
Motivated by improvements in constraint-solving technology and by the increase of routinely available computational power, partial-program synthesis is emerging as an effective a...
Pavol Cerný, Thomas A. Henzinger
VEE
2012
ACM
222views Virtualization» more  VEE 2012»
14 years 2 months ago
Unpicking the knot: teasing apart VM/application interdependencies
Flexible and efficient runtime design requires an understanding of the dependencies among the components internal to the runtime and those between the application and the runtime...
Yi Lin, Stephen M. Blackburn, Daniel Frampton
MOBICOM
2012
ACM
13 years 9 months ago
MIDU: enabling MIMO full duplex
Given that full duplex (FD) and MIMO both employ multiple antenna resources, an important question that arises is how to make the choice between MIMO and FD? We show that optimal ...
Ehsan Aryafar, Mohammad Ali Khojastepour, Karthike...
ISCA
2012
IEEE
243views Hardware» more  ISCA 2012»
13 years 9 months ago
BlockChop: Dynamic squash elimination for hybrid processor architecture
Hybrid processors are HW/SW co-designed processors that leverage blocked-execution, the execution of regions of instructions as atomic blocks, to facilitate aggressive speculative...
Jason Mars, Naveen Kumar
GIS
2006
ACM
16 years 8 months ago
Exploiting a page-level upper bound for multi-type nearest neighbor queries
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
Xiaobin Ma, Shashi Shekhar, Hui Xiong, Pusheng Zha...
« Prev « First page 1475 / 1896 Last » Next »