Sciweavers

336 search results - page 66 / 68
» Permutation Problems and Channelling Constraints
Sort
View
TSP
2011
152views more  TSP 2011»
13 years 2 months ago
Blind Adaptive Constrained Constant-Modulus Reduced-Rank Interference Suppression Algorithms Based on Interpolation and Switched
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
Rodrigo C. de Lamare, Raimundo Sampaio Neto, Marti...
DAC
2010
ACM
13 years 10 months ago
Trace-driven optimization of networks-on-chip configurations
Networks-on-chip (NoCs) are becoming increasingly important in general-purpose and application-specific multi-core designs. Although uniform router configurations are appropriate ...
Andrew B. Kahng, Bill Lin, Kambiz Samadi, Rohit Su...
PE
2002
Springer
176views Optimization» more  PE 2002»
13 years 7 months ago
Effective bandwidth estimation and testing for Markov sources
This work addresses the resource sharing problem in broadband communication networks that can guarantee some quality of service (QoS), and develops some results about data source ...
Juan Pechiar, Gonzalo Perera, María Simon
PERCOM
2005
ACM
14 years 7 months ago
Security Parallels between People and Pervasive Devices
Unique and challenging security problems arise due to the scarcity of computational, storage, and power resources in the low-cost pervasive computing environment. Particularly rel...
Stephen A. Weis
CP
2003
Springer
14 years 21 days ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...