Sciweavers

1169 search results - page 117 / 234
» Degrees of monotone complexity
Sort
View
SAS
2005
Springer
132views Formal Methods» more  SAS 2005»
16 years 10 days 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,...
SSS
2005
Springer
16 years 10 days 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»
16 years 10 days 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...
ECML
2004
Springer
16 years 7 days 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
ICCSA
2004
Springer
16 years 7 days 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