Sciweavers

3471 search results - page 619 / 695
» Obstacle Numbers of Graphs
Sort
View
COLT
2008
Springer
15 years 6 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
CP
2008
Springer
15 years 6 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
125
Voted
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 6 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 6 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...
159
Voted
EUROPAR
2008
Springer
15 years 6 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...