Sciweavers

2365 search results - page 61 / 473
» All things are connected
Sort
View
ENDM
2002
97views more  ENDM 2002»
15 years 1 months ago
Traceability in Small Claw-Free Graphs
We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices an...
John M. Harris, Michael J. Mossinghoff
CORR
2002
Springer
120views Education» more  CORR 2002»
15 years 1 months ago
A Comparison of Different Cognitive Paradigms Using Simple Animats in a Virtual Laboratory, with Implications to the Notion of C
In this thesis I present a virtual laboratory which implements five different models for controlling animats: a rule-based system, a behaviour-based system, a concept-based system...
Carlos Gershenson
SYNTHESE
2010
54views more  SYNTHESE 2010»
14 years 11 months ago
Two contextualist fallacies
I examine the radical contextualists’ two main arguments for the semantic underdeterminacy thesis, according to which all, or almost all, English sentences lack context-independ...
Martin Montminy
DGCI
2006
Springer
15 years 5 months ago
On Minimal Perimeter Polyminoes
This paper explores proofs of the isoperimetric inequality for 4-connected shapes on the integer grid Z2 , and its geometric meaning. Pictorially, we discuss ways to place a maxima...
Yaniv Altshuler, Vladimir Yanovski, Daniel Vainsen...
DM
2008
86views more  DM 2008»
15 years 1 months ago
Hamiltonian properties of triangular grid graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
Valery S. Gordon, Yury L. Orlovich, Frank Werner