Sciweavers

1686 search results - page 181 / 338
» Programs as polygraphs: computability and complexity
Sort
View
JACM
2010
137views more  JACM 2010»
15 years 2 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
MST
2010
101views more  MST 2010»
15 years 2 months ago
Non-Uniform Reductions
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
Harry Buhrman, Benjamin J. Hescott, Steven Homer, ...
OR
2010
Springer
15 years 2 months ago
Modeling organic carbon and carbon-mediated soil processes in DSSAT v4.5
Cropping systems models have evolved over the last four decades in response to the demand for modeling to address more complex questions, including issues on sustainable productio...
Cheryl H. Porter, J. W. Jones, S. Adiku, A. J. Gij...
RV
2010
Springer
177views Hardware» more  RV 2010»
15 years 2 months ago
Runtime Instrumentation for Precise Flow-Sensitive Type Analysis
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...
Etienne Kneuss, Philippe Suter, Viktor Kuncak
IWCMC
2010
ACM
15 years 1 months ago
Dynamic load balancing and throughput optimization in 3GPP LTE networks
Load imbalance that deteriorates the system performance is a severe problem existing in 3GPP LTE networks. To deal with this problem, we propose in this paper a load balancing fra...
Hao Wang, Lianghui Ding, Ping Wu, Zhiwen Pan, Nan ...