Sciweavers

1242 search results - page 80 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
CSL
2005
Springer
15 years 11 months ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys
COMPGEOM
2010
ACM
15 years 11 months ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...
UPP
2004
Springer
15 years 11 months ago
Grassroots Approach to Self-management in Large-Scale Distributed Systems
Abstract. Traditionally, autonomic computing is envisioned as replacing the human factor in the deployment, administration and maintenance of computer systems that are ever more co...
Özalp Babaoglu, Márk Jelasity, Alberto...
CHI
1995
ACM
15 years 9 months ago
Belvedere: stimulating students' critical discussion
We describe “Belvedere,” a system to support students engaged in critical discussion of science and public policy issues. The design is intended to address cognitive and metac...
Massimo Paolucci, Daniel D. Suthers, Arlene Weiner
ECSQARU
1997
Springer
15 years 9 months ago
Creating Prototypes for Fast Classification in Dempster-Shafer Clustering
We develop a classification method for incoming pieces of evidence in Dempster-Shafer theory. This methodology is based on previous work with clustering and specification of origin...
Johan Schubert