2194 search results - page 72 / 439 » Improving HLRTA*( k ) |
115
click to vote
EJC
2006
14 years 12 months ago
2006
1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...
JCT
2006
14 years 12 months ago
2006
We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k = s1 + s2, si S; such sets are called Sidon sets if g = 2 a...
105
click to vote
MVA
2008
14 years 11 months ago
2008
We present a generic framework for enhanced active multi-sensing. We propose a coopetitive interaction approach, which combines the salient features of cooperation and competition ...
SIGCSE
2008
ACM
14 years 11 months ago
2008
ACM
Abstract: In Peru, the computing discipline as an academic field has been neglected during decades deriving in a lowquality higher education system and consequently shaping an acad...
RSA
2000
14 years 11 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...