4894 search results - page 99 / 979 » Choices |
145
Voted
SIAMDM
2008
15 years 6 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
185
Voted
IJUFKS
2007
15 years 6 months ago
2007
Abstract. Resampling methods are among the best approaches to determine the number of clusters in prototype-based clustering. The core idea is that with the right choice for the nu...
176
Voted
JOT
2007
15 years 6 months ago
2007
State machines can be used to specify the behaviour of objects in a system by describing the relationships between the states of the object and its ability to respond to events pr...
133
click to vote
LOGCOM
2007
15 years 6 months ago
2007
The principle sPHPa b (PV (α)) states that no oracle circuit can compute a surjection of a onto b. We show that sPHP (a) P (a)(PV (α)) is independent of PV1(α)+sPHP π(a) Π(a)...
116
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
B This paper examinesthe integration of computational complexity into gametheoretic models. Theexample focused on is the Prisoner’s Dilemma,repeated for a finite length of time....