Sciweavers

4940 search results - page 366 / 988
» On the Complexity of Universal Programs
Sort
View
ENTCS
2002
121views more  ENTCS 2002»
15 years 6 months ago
Regular Expression Types for Strings in a Text Processing Language
d Abstract) Naoshi Tabuchi Eijiro Sumii Akinori Yonezawa 1 Department of Computer Science, Graduate School of Information Science and Technology, University of Tokyo We present re...
Naoshi Tabuchi, Eijiro Sumii, Akinori Yonezawa
PERCOM
2010
ACM
15 years 5 months ago
UpperWare: Bringing resources back to the system
If we expect the computer to vanish in the background, to make pervasive computing a reality, first we must be able to provide the illusion that all the user’s computers, devic...
Francisco J. Ballesteros, Gorka Guardiola, Enrique...
IADIS
2009
15 years 4 months ago
Rendezvous-based associations: Language abstractions for robot collaboration
IONS FOR ROBOT COLLABORATION Bent Bruun Kristensen Maersk Mc-Kinney Moller Institute, University of Southern Denmark Campusvej 55, DK-5230, Odense M, Denmark Collaboration between...
Bent Bruun Kristensen
CE
2010
146views more  CE 2010»
15 years 4 months ago
Computer-game construction: A gender-neutral attractor to Computing Science
: Enrollment in Computing Science university programs is at a dangerously low level. A major reason for this is the general lack of interest in Computing Science by females. In thi...
Mike Carbonaro, Duane Szafron, Maria Cutumisu, Jon...
ENTCS
2010
88views more  ENTCS 2010»
15 years 4 months ago
Range and Set Abstraction using SAT
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
Edd Barrett, Andy King