Sciweavers

12183 search results - page 2210 / 2437
» Computers under Attacks!
Sort
View
SPAA
2004
ACM
15 years 12 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
SPAA
2004
ACM
15 years 12 months ago
Adaptive channel queue routing on k-ary n-cubes
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
Arjun Singh, William J. Dally, Amit K. Gupta, Bria...
WMPI
2004
ACM
15 years 12 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
AISC
2004
Springer
15 years 12 months ago
Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy
Abstract. We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathem...
Bruno Buchberger
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
15 years 12 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...
« Prev « First page 2210 / 2437 Last » Next »