Sciweavers

11345 search results - page 23 / 2269
» Foundations of Computer Science
Sort
View
FOIS
2008
13 years 9 months ago
SKIing with DOLCE: toward an e-Science Knowledge Infrastructure
: An ontology of general science knowledge (SKIo) is developed to enhance machine representation and use of scientific theories in emerging e-Science Knowledge Infrastructures. SKI...
Boyan Brodaric, Femke Reitsma, Yi Qiang
BSL
2006
109views more  BSL 2006»
13 years 7 months ago
Computing with functionals - computability theory or computer science?
We review some of the history of the computability theory of functionals of higher types, and we will demonstrate how contributions from logic and theoretical computer science hav...
Dag Normann
SIGSOFT
2007
ACM
14 years 8 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
13 years 12 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson
FM
2006
Springer
172views Formal Methods» more  FM 2006»
13 years 11 months ago
The Embedded Systems Design Challenge
We summarize some current trends in embedded systems design and point out some of their characteristics, such as the chasm between analytical and computational models, and the gap ...
Thomas A. Henzinger, Joseph Sifakis