Sciweavers

5607 search results - page 855 / 1122
» Graph structure in the Web
Sort
View
DISOPT
2008
113views more  DISOPT 2008»
15 years 6 months ago
The inverse 1-median problem on a cycle
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
Rainer E. Burkard, Carmen Pleschiutschnig, Jianzho...
ENTCS
2008
97views more  ENTCS 2008»
15 years 6 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann
IANDC
2006
82views more  IANDC 2006»
15 years 6 months ago
Recognizability, hypergraph operations, and logical types
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
Achim Blumensath, Bruno Courcelle
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 6 months ago
Mathematical analysis of the recoil growth algorithm to generate multi-polymer systems
The Recoil Growth algorithm, proposed in 1999 by Consta et al., is one of the most efficient algorithm available in the literature to sample from a multi-polymer system. While the ...
F. Simatos
CORR
2007
Springer
147views Education» more  CORR 2007»
15 years 6 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will