Sciweavers

1169 search results - page 117 / 234
» Degrees of monotone complexity
Sort
View
110
Voted
SAS
2005
Springer
132views Formal Methods» more  SAS 2005»
15 years 6 months ago
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
Roberto Bagnara, Enric Rodríguez-Carbonell,...
94
Voted
SSS
2005
Springer
15 years 6 months ago
A Snap-Stabilizing DFS with a Lower Space Requirement
Abstract. A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In [4], we presented the first snap-stab...
Alain Cournier, Stéphane Devismes, Vincent ...
WDAG
2005
Springer
130views Algorithms» more  WDAG 2005»
15 years 6 months ago
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...
105
Voted
ECML
2004
Springer
15 years 6 months ago
Inducing Polynomial Equations for Regression
Regression methods aim at inducing models of numeric data. While most state-of-the-art machine learning methods for regression focus on inducing piecewise regression models (regres...
Ljupco Todorovski, Peter Ljubic, Saso Dzeroski
71
Voted
ICCSA
2004
Springer
15 years 6 months ago
High Throughput in-silico Screening against Flexible Protein Receptors
We report results for the in-silico screening of a database of 10000 flexible compounds against various crystal structures of the thymidine kinase receptor complexed with 10 know...
Holger Merlitz, Wolfgang Wenzel