Sciweavers

1920 search results - page 24 / 384
» The Complexity of the A B C Problem
Sort
View
ICCAD
2006
IEEE
141views Hardware» more  ICCAD 2006»
16 years 2 months ago
A code refinement methodology for performance-improved synthesis from C
Although many recent advances have been made in hardware synthesis techniques from software programming languages such as C, the performance of synthesized hardware commonly suffe...
Greg Stitt, Frank Vahid, Walid A. Najjar
DAC
2002
ACM
16 years 6 months ago
Embedded software-based self-testing for SoC design
At-speed testing of high-speed circuits is becoming increasingly difficult with external testers due to the growing gap between design and tester performance, growing cost of high...
Angela Krstic, Wei-Cheng Lai, Kwang-Ting Cheng, Li...
BMCBI
2008
150views more  BMCBI 2008»
15 years 5 months ago
13C labeling experiments at metabolic nonstationary conditions: An exploratory study
Background: Stimulus Response Experiments to unravel the regulatory properties of metabolic networks are becoming more and more popular. However, their ability to determine enzyme...
Sebastian Aljoscha Wahl, Katharina Nöh, Wolfg...
SIAMCO
2008
83views more  SIAMCO 2008»
15 years 5 months ago
Necessary Conditions for Multiobjective Optimal Control Problems with Free End-Time
Abstract. Necessary conditions of optimality are derived for multiobjective optimal control problems with free end-time, in which the dynamics constraint is modeled as a nonconvex ...
B. T. Kien, N.-C. Wong, J. C. Yao
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 7 months ago
An improved approximation algorithm for the partial latin square extension problem
Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulat...
Carla P. Gomes, Rommel G. Regis, David B. Shmoys