11395 search results - page 2042 / 2279 » Beyond computer science |
176
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
185
click to vote
ENTCS
2006
15 years 6 months ago
2006
Temporal logics are well suited for the specification and verification of systems of communicating agents. In this paper we adopt a social approach to agent communication, where c...
144
click to vote
ENTCS
2006
15 years 6 months ago
2006
nary abstract) Jan Friso Groote 1 MohammadReza Mousavi 2 Michel A. Reniers 3 Department of Computer Science, Eindhoven University of Technology (TU/e), P.O. Box 513, NL-5600 MB Ein...
175
click to vote
EOR
2006
15 years 6 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
182
click to vote
IPM
2008
15 years 6 months ago
2008
The presentation of search results on the web has been dominated by the textual form of document representation. On the other hand, the document's visual aspects such as the ...