Sciweavers

4917 search results - page 133 / 984
» Software Engineering is Not Computer Science
Sort
View
APAL
2011
14 years 9 months ago
The complexity of central series in nilpotent computable groups
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
Barbara F. Csima, Reed Solomon
ISSTA
2006
ACM
15 years 8 months ago
The case for analysis preserving language transformation
Static analysis has gained much attention over the past few years in applications such as bug finding and program verification. As software becomes more complex and componentize...
Xiaolan Zhang, Larry Koved, Marco Pistoia, Sam Web...
AII
1989
15 years 6 months ago
Inductive Inference, DFAs, and Computational Complexity
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
Leonard Pitt
APSEC
2004
IEEE
15 years 6 months ago
SA-RFID: Situation-Aware RFID Architecture Analysis in Ubiquitous Computing
Sensors in ubiquitous computing provide a new opportunity to extend existing RFID capabilities to situation-awareness. This paper proposes several alternatives of the Situation-Aw...
Dongwon Jeong, Young-Gab Kim, Hoh Peter In
AC
2011
Springer
14 years 9 months ago
A Taxonomy and Survey of Energy-Efficient Data Centers and Cloud Computing Systems
Traditionally, the development of computing systems has been focused on performance improvements driven by the demand of applications from consumer, scientific, and business domai...
Anton Beloglazov, Rajkumar Buyya, Young Choon Lee,...