Sciweavers

5183 search results - page 970 / 1037
» The Complexity of Distributions
Sort
View
ACSC
2005
IEEE
15 years 11 months ago
A Two-Pronged Attack on the Dragon of Intractability
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
Stephen Gilmour, Mark Dras
ASAP
2005
IEEE
121views Hardware» more  ASAP 2005»
15 years 11 months ago
Using TLM for Exploring Bus-based SoC Communication Architectures
As billion transistor System-on-chips (SoC) become commonplace and design complexity continues to increase, designers are faced with the daunting task of meeting escalating design...
Sudeep Pasricha, Mohamed Ben-Romdhane
CCGRID
2005
IEEE
15 years 11 months ago
Efficient resource description and high quality selection for virtual grids
Simple resource specification, resource selection, and effective binding are critical capabilities for Grid middleware. We the Virtual Grid, an abstraction for dynamic grid applic...
Yang-Suk Kee, D. Logothetis, Richard Y. Huang, Hen...
CSB
2005
IEEE
210views Bioinformatics» more  CSB 2005»
15 years 11 months ago
Problem Solving Environment Approach to Integrating Diverse Biological Data Sources
Scientists face an ever-increasing challenge in investigating biological systems with high throughput experimental methods such as mass spectrometry and gene arrays because of the...
Eric G. Stephan, Kyle R. Klicker, Mudita Singhal, ...
IEEEPACT
2005
IEEE
15 years 11 months ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove