Sciweavers

1253 search results - page 160 / 251
» Studying Software Evolution for Taming Software Complexity
Sort
View
FSTTCS
2010
Springer
13 years 8 months ago
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
Sebastian Ordyniak, Daniël Paulusma, Stefan S...
VTC
2007
IEEE
130views Communications» more  VTC 2007»
14 years 4 months ago
Data Stream Processing Infrastructure for Intelligent Transport Systems
— Intelligence Transportation Systems are critical to improve the efficiency of modern transportation by reducing congestions, providing real time road conditions. A system that...
Eric Bouillet, Mark Feblowitz, Zhen Liu, Anand Ran...
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
14 years 4 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
AOSE
2007
Springer
14 years 2 months ago
Refining Goal Models by Evaluating System Behaviour
Abstract. Nowadays, information systems have to perform in complex, heterogeneous environments, considering a variety of system users with different needs and preferences. Software...
Mirko Morandini, Loris Penserini, Anna Perini, Ang...
EUROMICRO
2009
IEEE
14 years 1 months ago
Service Redundancy Strategies in Service-Oriented Architectures
Redundancy can improve the availability of components in service-oriented systems. However, predicting and quantifying the effects of different redundancy strategies can be a comp...
Nicholas R. May, Heinz W. Schmidt, Ian E. Thomas