Sciweavers

4047 search results - page 476 / 810
» Algebraic Model Checking
Sort
View
LFCS
2007
Springer
16 years 26 days ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
CW
2006
IEEE
16 years 24 days ago
A New Method for Developing Business Applications: The Cellular Data System
Currently, in the development of business applications, difficulties occasionally arise between the customer side and the supplier side, causing delays and higher development cost...
Toshio Kodama, Tosiyasu L. Kunii, Yoichi Seki
ADC
2005
Springer
114views Database» more  ADC 2005»
16 years 8 days ago
Optimization of Relational Preference Queries
The design and implementation of advanced personalized database applications requires a preference-driven approach. Representing preferences as strict partial orders is a good cho...
Bernd Hafenrichter, Werner Kießling
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
16 years 8 days ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
EUROMICRO
1999
IEEE
15 years 11 months ago
Software Synthesis for System Level Design Using Process Execution Trees
Software synthesis for system level design languages becomes feasible because the current technology, pricing and application trends will most likely alleviate the industrial empha...
Leo J. van Bokhoven, Jeroen Voeten, Marc Geilen