Sciweavers

1144 search results - page 132 / 229
» Fractal Algorithm for Finding Global Optimal Solution
Sort
View
ICASSP
2011
IEEE
14 years 6 months ago
Space-time beamforming for multiuser wireless relay networks
Abstract—The paper is concerned with a multiuser communication network, which is assisted by multiple relays. It has been observed through our previous related works that the con...
Anh H. Phan, Hoang Duong Tuan, Ha Hoang Kha
FOCS
2000
IEEE
15 years 7 months ago
Fairness Measures for Resource Allocation
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
Amit Kumar, Jon M. Kleinberg
JMLR
2006
145views more  JMLR 2006»
15 years 3 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
LCTRTS
2001
Springer
15 years 7 months ago
A Dynamic Programming Approach to Optimal Integrated Code Generation
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...
Christoph W. Keßler, Andrzej Bednarski
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 7 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...