42230 search results - page 2 / 8446 » Algorithms and Complexity Results for |
IJHPCA
2006
13 years 5 months ago
2006
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
COCO
2005
Springer
13 years 11 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
HYBRID
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
WWW
2005
ACM
14 years 6 months ago
2005
ACM
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
STOC
1997
ACM
13 years 9 months ago
1997
ACM
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models: