481 search results - page 18 / 97 » Martin's game: a lower bound for the number of sets |
GD
2003
Springer
14 years 1 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
TPHOL
2005
IEEE
14 years 2 months ago
2005
IEEE
Wouldn’t it be nice to be able to conveniently use ordinary real number expressions within proof assistants? In this paper we outline how this can be done within a theorem provin...
STACS
1999
Springer
14 years 25 days ago
1999
Springer
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
DATAMINE
2006
13 years 8 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
WINE
2009
Springer
14 years 3 months ago
2009
Springer
Recent results regarding games with congestion-averse utilities (or, congestion-averse games—CAGs) have shown they possess some very desirable properties. Specifically, they hav...