Sciweavers

519 search results - page 51 / 104
» Granular Problem Solving and Software Engineering
Sort
View
ICST
2010
IEEE
14 years 10 months ago
Satisfying Test Preconditions through Guided Object Selection
—A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditi...
Yi Wei, Serge Gebhardt, Bertrand Meyer, Manuel Ori...
FSTTCS
2010
Springer
14 years 9 months ago
Global Model Checking of Ordered Multi-Pushdown Systems
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
Mohamed Faouzi Atig
UIST
2010
ACM
14 years 9 months ago
MAI painting brush: an interactive device that realizes the feeling of real painting
Many digital painting systems have been proposed and their quality is improving. In these systems, graphics tablets are widely used as input devices. However, because of its rigid...
Mai Otsuki, Kenji Sugihara, Asako Kimura, Fumihisa...
TC
2011
14 years 6 months ago
Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
Xiang-Yang Li, Yajun Wang, Yu Wang
SIAMCOMP
2011
14 years 2 months ago
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...