Sciweavers

609 search results - page 106 / 122
» Optimizing Design for Variability Using Traceability Links
Sort
View
ASPDAC
2000
ACM
109views Hardware» more  ASPDAC 2000»
13 years 11 months ago
A technique for QoS-based system partitioning
Quality of service (QoS) has been an important topic of many research communities. Combined with an advanced and retargetable compiler, variability of applicationsspecific very lar...
Johnson S. Kin, Chunho Lee, William H. Mangione-Sm...
IPCO
2008
118views Optimization» more  IPCO 2008»
13 years 8 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
ICASSP
2010
IEEE
13 years 7 months ago
A minimax approach to Bayesian estimation with partial knowledge of the observation model
We address the problem of Bayesian estimation where the statistical relation between the signal and measurements is only partially known. We propose modeling partial Baysian knowl...
Tomer Michaeli, Yonina C. Eldar
DEBU
2000
147views more  DEBU 2000»
13 years 7 months ago
Adaptive Query Processing for Internet Applications
As the area of data management for the Internet has gained in popularity, recent work has focused on effectively dealing with unpredictable, dynamic data volumes and transfer rate...
Zachary G. Ives, Alon Y. Levy, Daniel S. Weld, Dan...
ICAI
2010
13 years 5 months ago
Constraint-Based Dogleg Channel Routing with Via Minimization
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
I-Lun Tseng, Huan-Wen Chen, Che-I Lee, Adam Postul...