Sciweavers

1259 search results - page 251 / 252
» Efficient Wire Formats for High Performance Computing
Sort
View
CGO
2006
IEEE
13 years 9 months ago
Profiling over Adaptive Ranges
Modern computer systems are called on to deal with billions of events every second, whether they are instructions executed, memory locations accessed, or packets forwarded. This p...
Shashidhar Mysore, Banit Agrawal, Timothy Sherwood...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 9 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini
BMCBI
2010
151views more  BMCBI 2010»
13 years 6 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
TCOM
2008
94views more  TCOM 2008»
13 years 5 months ago
Transmit power allocation for successive interference cancellation in multicode MIMO systems
Multiple-input multiple-output (MIMO) system with multicode transmission can provide high speed data services by transmitting independent parallel substreams from multiple antennas...
Chang Soon Park, Kwang Bok Lee
COMCOM
2004
110views more  COMCOM 2004»
13 years 5 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu