Sciweavers

2542 search results - page 12 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
SP
2002
IEEE
165views Security Privacy» more  SP 2002»
13 years 7 months ago
NINJA: Java for high performance numerical computing
When Java was first introduced, there was a perception that its many benefits came at a significant performance cost. In the particularly performance-sensitive field of numerical ...
José E. Moreira, Samuel P. Midkiff, Manish ...
AAAI
2000
13 years 9 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
WG
2004
Springer
14 years 29 days ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
WICON
2008
13 years 9 months ago
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
Peng Wang, Stephan Bohacek
QOSA
2010
Springer
13 years 9 months ago
Architecture-Driven Reliability and Energy Optimization for Complex Embedded Systems
The use of redundant computational nodes is a widely used design tactic to improve the reliability of complex embedded systems. However, this redundancy allocation has also an effe...
Indika Meedeniya, Barbora Buhnova, Aldeida Aleti, ...