Sciweavers

923 search results - page 64 / 185
» The Computational Structure of Progress Conditions
Sort
View
ECCC
2002
103views more  ECCC 2002»
14 years 9 months ago
Monotone complexity and the rank of matrices
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
Pavel Pudlák
ESOP
2006
Springer
15 years 1 months ago
Pure Pattern Calculus
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
C. Barry Jay, Delia Kesner
P2P
2007
IEEE
113views Communications» more  P2P 2007»
15 years 4 months ago
Handling Network Partitions and Mergers in Structured Overlay Networks
Structured overlay networks form a major class of peerto-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-s...
Tallat M. Shafaat, Ali Ghodsi, Seif Haridi
BIOINFORMATICS
2011
14 years 1 months ago
A method for probing the mutational landscape of amyloid structure
Motivation: Proteins of all kinds can self-assemble into highly ordered β-sheet aggregates known as amyloid fibrils, important both biologically and clinically. However, the spe...
Charles W. O'Donnell, Jérôme Waldisp&...
ICTAI
2009
IEEE
14 years 7 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux