4378 search results - page 171 / 876 » On the Complexity of Ordered Colourings |
183
click to vote
AAECC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
186
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
171
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
192
click to vote
IANDC
2006
15 years 6 months ago
2006
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...
178
click to vote
PKDD
2001
Springer
15 years 11 months ago
2001
Springer
This paper discusses the clustering quality and complexities of the hierarchical data clustering algorithm based on gravity theory. The gravitybased clustering algorithm simulates ...