3378 search results - page 257 / 676 » A universe of binding and computation |
161
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
d Abstract) Dan Erusalimchik1 , Gal A. Kaminka1 , Shai Shlomai2 , Dov Miron1 , and Sarit Kraus2 The 1 MAVERICK Group and the 2 Multi-Agent Systems Group Computer Science Department...
197
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
ABSTRACT. We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees. In particular, we show that the emptiness pro...
128
click to vote
JCDL
2006
ACM
16 years 20 days ago
2006
ACM
The Virginia Tech Department of Computer Science (VT CS) and the University of North Carolina at Chapel Hill School of Information and Library Science (UNC SILS) have launched a c...
160
Voted
BIRTHDAY
2010
Springer
15 years 11 months ago
2010
Springer
Domain Patrick Cousot2,3 , Radhia Cousot1,3 , and Laurent Mauborgne3,4 1 Centre National de la Recherche Scientifique 2 Courant Institute of Mathematical Sciences, New York Univer...
159
click to vote
AUIC
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper we propose that a metaphor can be used to represent domains that are not easily quantifiable. The metaphor then can be used as an interface to communicate informatio...