Sciweavers

188 search results - page 25 / 38
» A System-Level Synthesis Algorithm with Guaranteed Solution ...
Sort
View
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
14 years 4 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris
AAAI
2006
13 years 9 months ago
Probabilistic Temporal Planning with Uncertain Durations
Few temporal planners handle both concurrency and uncertain durations, but these features commonly co-occur in realworld domains. In this paper, we discuss the challenges caused b...
Mausam, Daniel S. Weld
DAC
2006
ACM
14 years 8 months ago
Design space exploration using time and resource duality with the ant colony optimization
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
Gang Wang, Wenrui Gong, Brian DeRenzi, Ryan Kastne...
ICCAD
2003
IEEE
170views Hardware» more  ICCAD 2003»
14 years 4 months ago
Evaluation of Placement Techniques for DNA Probe Array Layout
DNA probe arrays have emerged as a core genomic technology that enables cost-effective gene expression monitoring, mutation detection, single nucleotide polymorphism analysis and ...
Andrew B. Kahng, Ion I. Mandoiu, Sherief Reda, Xu ...
JMLR
2006
145views more  JMLR 2006»
13 years 7 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street