Sciweavers

4940 search results - page 742 / 988
» On the Complexity of Universal Programs
Sort
View
KR
1992
Springer
15 years 10 months ago
Order of Magnitude Reasoning using Logarithms
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
P. Pandurang Nayak
AGTIVE
2007
Springer
15 years 10 months ago
Shaped Generic Graph Transformation
Abstract. Since the systematic evolution of graph-like program models has become important in software engineering, graph transformation has gained much attention in this area. For...
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Ma...
CISS
2007
IEEE
15 years 10 months ago
Channel-Adaptive Optimal OFDMA Scheduling
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
Xin Wang, Georgios B. Giannakis, Yingqun Yu
DOCENG
2007
ACM
15 years 10 months ago
Declarative extensions of XML languages
We present a set of XML language extensions that bring notions from functional programming to web authors, extending the power of declarative modelling for the web. Our previous w...
Simon J. Thompson, Peter R. King, Patrick Schmitz
FDL
2007
IEEE
15 years 10 months ago
A Metamodeling based Framework for Architectural Modeling and Simulator Generation
Functional validation of microprocessors is growing in complexity in current and future microprocessors. The informal specification document from which the various collaterals are ...
Deepak Mathaikutty, Ajit Dingankar, Sandeep K. Shu...