Sciweavers

7840 search results - page 129 / 1568
» On generalized Ramsey numbers
Sort
View
CRYPTO
2006
Springer
99views Cryptology» more  CRYPTO 2006»
14 years 2 months ago
Scalable Secure Multiparty Computation
We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settin...
Ivan Damgård, Yuval Ishai
TSMC
2002
125views more  TSMC 2002»
13 years 10 months ago
Dynamic page based crossover in linear genetic programming
Page-based Linear Genetic Programming (GP) is proposed in which individuals are described in terms of a number of pages. Pages are expressed in terms of a fixed number of instructi...
Malcolm I. Heywood, A. Nur Zincir-Heywood
DM
2006
79views more  DM 2006»
13 years 10 months ago
Conditional colorings of graphs
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Ta...
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 10 months ago
A parametric representation of totally mixed Nash equilibria
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
Gabriela Jeronimo, Daniel Perrucci, Juan Sabia
ENDM
2007
111views more  ENDM 2007»
13 years 10 months ago
Claw-free circular-perfect graphs
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
Arnaud Pêcher, Xuding Zhu