109 search results - page 13 / 22 » dm 2007 |
119
Voted
DM
2007
15 years 1 months ago
2007
: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G...
DM
2007
15 years 1 months ago
2007
We consider matroidal structures on convex geometries, which we call cg-matroids. The concept of a cg-matroid is closely related to but different from that of a supermatroid intro...
109
click to vote
DM
2008
15 years 2 months ago
2008
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primitively on the set of vertices. If F consists of Hamiltonian cycles, then F is the...
TARK
2007
Springer
15 years 8 months ago
2007
Springer
This paper studies games with uncertainty where players have different awareness regarding a chance player’s moves (contingencies). An announcer, who is fully aware of the cont...
125
Voted
EAAI
2007
15 years 1 months ago
2007
The task-oriented nature of data mining (DM) has already been dealt successfully with the employment of intelligent agent systems that distribute tasks, collaborate and synchroniz...