Sciweavers

13603 search results - page 408 / 2721
» On the Complexity of Computing Treelength
Sort
View
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
15 years 11 months ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama
CCGRID
2004
IEEE
15 years 11 months ago
Distributed virtual computers (DVC): simplifying the development of high performance Grid applications
Distributed Virtual Computer (DVC) is a computing environment which simplifies the development and execution of distributed applications on computational grids. DVC provides a sim...
Nut Taesombut, Andrew A. Chien
AAAI
2007
15 years 10 months ago
Mutual Belief Revision: Semantics and Computation
This paper presents both a semantic and a computational model for multi-agent belief revision. We show that these two models are equivalent but serve different purposes. The seman...
Yi Jin, Michael Thielscher, Dongmo Zhang
CMG
2004
15 years 9 months ago
Quality of Service Aspects and Metrics In Grid Computing
Grid computing promises to become the future computing paradigm for enterprise application after having shown to be a quite effective computing paradigm for resource-intensive sci...
Daniel A. Menascé, Emiliano Casalicchio
CSREASAM
2003
15 years 9 months ago
Developing Secure Web Services for Computational Portals
Computational web portals provide uniform access to remote computational resources--hardware, software, and data--by hiding the complexity of the heterogeneous, distributed, high ...
Choon-Han Youn, Marlon E. Pierce, Geoffrey Fox