Sciweavers

2877 search results - page 403 / 576
» The Complexity of Planarity Testing
Sort
View
CBSE
2005
Springer
15 years 9 months ago
Performance Prediction of J2EE Applications Using Messaging Protocols
Abstract. Predicting the performance of component-based applications is difficult due to the complexity of the underlying component technology. This problem is exacerbated when a m...
Yan Liu, Ian Gorton
CD
2005
Springer
15 years 9 months ago
Infrastructure for Automatic Dynamic Deployment of J2EE Applications in Distributed Environments
Recent studies showed potential for using component frameworks for building flexible adaptible applications for deployment in distributed environments. However this approach is h...
Anatoly Akkerman, Alexander Totok, Vijay Karamchet...
DEXA
2005
Springer
80views Database» more  DEXA 2005»
15 years 9 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
EGH
2005
Springer
15 years 9 months ago
Optimal automatic multi-pass shader partitioning by dynamic programming
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
Alan Heirich
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 9 months ago
A comparison of evolutionary algorithms for system-level diagnosis
The size and complexity of systems based on multiple processing units demand techniques for the automatic diagnosis of their state. System-level diagnosis consists in determining ...
Bogdan Tomoyuki Nassu, Elias Procópio Duart...