Sciweavers

861 search results - page 135 / 173
» Polymorphic Time Systems for Estimating Program Complexity
Sort
View
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 1 months ago
Statistical Learning Techniques for Costing XML Queries
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
Ning Zhang 0002, Peter J. Haas, Vanja Josifovski, ...
CADE
2007
Springer
14 years 8 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
DAC
2006
ACM
14 years 8 months ago
Prototyping a fault-tolerant multiprocessor SoC with run-time fault recovery
Modern integrated circuits (ICs) are becoming increasingly complex. The complexity makes it difficult to design, manufacture and integrate these high-performance ICs. The advent o...
Xinping Zhu, Wei Qin
MOBILWARE
2009
ACM
14 years 2 months ago
Middleware Solutions for Self-organizing Multi-hop Multi-path Internet Connectivity Based on Bluetooth
The availability of heterogeneous wireless interfaces and of growing computing resources on widespread portable devices pushes for enabling innovative deployment scenarios where mo...
Paolo Bellavista, Carlo Giannelli
VTC
2008
IEEE
150views Communications» more  VTC 2008»
14 years 2 months ago
Impact of Signaling Load on the UMTS Call Blocking/Dropping
— Radio resources in the third generation (3G) wireless cellular networks (WCNs) such as the universal mobile telecommunications system (UMTS) network is limited in term of soft ...
Saowaphak Sasanus, David Tipper, Yi Qian