Sciweavers

1999 search results - page 137 / 400
» Finding Reductions Automatically
Sort
View
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
15 years 7 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
KBSE
2009
IEEE
15 years 4 months ago
Code Completion from Abbreviated Input
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
Sangmok Han, David R. Wallace, Robert C. Miller
DAC
2004
ACM
15 years 3 months ago
Area-efficient instruction set synthesis for reconfigurable system-on-chip designs
Silicon compilers are often used in conjunction with Field Programmable Gate Arrays (FPGAs) to deliver flexibility, fast prototyping, and accelerated time-to-market. Many of these...
Philip Brisk, Adam Kaplan, Majid Sarrafzadeh
ACMICEC
2007
ACM
102views ECommerce» more  ACMICEC 2007»
15 years 2 months ago
The impact of technology on the quality of information
When new technologies for production and dissemination of information emerge and are adopted, we see a dramatic increase in the quantity of information that is made available for ...
Aditi Mukherjee, Jungpil Hahn
CAV
2008
Springer
113views Hardware» more  CAV 2008»
15 years 1 days ago
Producing Short Counterexamples Using "Crucial Events"
Ideally, a model checking tool should successfully tackle state space explosion for complete system validation, while providing short counterexamples when an error exists. Techniqu...
Sujatha Kashyap, Vijay K. Garg