Sciweavers

4171 search results - page 761 / 835
» Choice numbers of graphs
Sort
View
CP
2008
Springer
15 years 8 months ago
Exploiting Common Subexpressions in Numerical CSPs
It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only...
Ignacio Araya, Bertrand Neveu, Gilles Trombettoni
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 8 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
ECAI
2008
Springer
15 years 8 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
EUROPAR
2008
Springer
15 years 8 months ago
Building Secure Resources to Ensure Safe Computations in Distributed and Potentially Corrupted Environments
Abstract. Security and fault-tolerance is a big issue for intensive parallel computing in pervasive environments with hardware errors or malicious acts that may alter the result. I...
Sébastien Varrette, Jean-Louis Roch, Guilla...
ATMOS
2007
119views Optimization» more  ATMOS 2007»
15 years 7 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte