1043 search results - page 117 / 209 » Reading, Writing and Relations |
189
click to vote
JCT
2007
15 years 6 months ago
2007
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue (G) of its adjacency matrix. In particular, writing ks (G) for the number of s...
141
click to vote
AROBOTS
2000
15 years 6 months ago
2000
In this paper, I describe a simple functional programming language, GRL, in which most of the characteristic features of the popular behavior-based robot architectures can be conc...
147
click to vote
CN
2000
15 years 6 months ago
2000
The Web contains an abundance of useful semi-structured information that can and should be mined. Types of structure include hyperlinks between pages, structure within hypertext p...
187
click to vote
JIS
2008
15 years 6 months ago
2008
Some developments in the information science discipline over a period of thirty years are discussed, by selecting topics covered in the early issues of Journal of Information Scie...
174
click to vote
KSEM
2010
Springer
15 years 4 months ago
2010
Springer
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...