Sciweavers

342 search results - page 34 / 69
» Constrained Integer Partitions
Sort
View
HPCA
2000
IEEE
15 years 2 months ago
Dynamic Cluster Assignment Mechanisms
Clustered microarchitectures are an effective approach to reducing the penalties caused by wire delays inside a chip. Current superscalar processors have in fact a two-cluster mic...
Ramon Canal, Joan-Manuel Parcerisa, Antonio Gonz&a...
108
Voted
VTC
2008
IEEE
117views Communications» more  VTC 2008»
15 years 4 months ago
Design of Rate Constrained Multi-User Receivers for Satellite Communications
—In the realm of satellite communications, one of the great impairments to increase the spectral efficiency is multi-user interference in the reverse link (mobile to satellite). ...
Sami Mekki, Mérouane Debbah
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
14 years 11 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
IPCO
2007
108views Optimization» more  IPCO 2007»
14 years 11 months ago
Orbital Branching
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
IPPS
2006
IEEE
15 years 3 months ago
Automatic application-specific microarchitecture reconfiguration
Applications for constrained embedded systems are subject to strict time constraints and restrictive resource utilization. With soft core processors, application developers can cu...
Shobana Padmanabhan, Ron K. Cytron, Roger D. Chamb...