Sciweavers

1221 search results - page 229 / 245
» Balanced graph partitioning
Sort
View
KBS
2007
56views more  KBS 2007»
13 years 7 months ago
Domain-dependent distributed models for railway scheduling
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
Miguel A. Salido, Montserrat Abril, Federico Barbe...
ENTCS
2002
89views more  ENTCS 2002»
13 years 7 months ago
ZEUS: A Distributed Timed Model-Checker Based on KRONOS
In this work we present Zeus, a Distributed Model-Checker that evolves from the tool Kronos [8] and that currently can handle backwards computation of TCTLreachability properties ...
Víctor A. Braberman, Alfredo Olivero, Ferna...
IPL
2002
118views more  IPL 2002»
13 years 7 months ago
Differential approximation results for the traveling salesman and related problems
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
Jérôme Monnot
JSYML
2002
170views more  JSYML 2002»
13 years 7 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
PC
2007
141views Management» more  PC 2007»
13 years 7 months ago
Physically based simulation of cloth on distributed memory architectures
Physically based simulation of cloth in virtual environments is a computationally demanding problem. It involves modeling the internal material properties of the textile (physical...
Bernhard Thomaszewski, Wolfgang Blochinger