Sciweavers

1617 search results - page 27 / 324
» Constraints in Weighted Averaging
Sort
View
JOIN
2007
91views more  JOIN 2007»
14 years 11 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
VLSID
2007
IEEE
209views VLSI» more  VLSID 2007»
16 years 3 days ago
Simultaneous Power Fluctuation and Average Power Minimization during Nano-CMOS Behavioral Synthesis
We present minimization methodologies and an algorithm for simultaneous scheduling, binding, and allocation for the reduction of total power and power fluctuation during behaviora...
Saraju P. Mohanty, Elias Kougianos
CORR
2006
Springer
112views Education» more  CORR 2006»
14 years 11 months ago
Satisfying KBO Constraints
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
Harald Zankl, Aart Middeldorp
SIAMNUM
2010
120views more  SIAMNUM 2010»
14 years 6 months ago
Well Conditioned Spherical Designs for Integration and Interpolation on the Two-Sphere
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial o...
Congpei An, Xiaojun Chen, Ian H. Sloan, Robert S. ...
ANCS
2009
ACM
14 years 9 months ago
Weighted random oblivious routing on torus networks
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
Rohit Sunkam Ramanujam, Bill Lin