1686 search results - page 125 / 338 » Programs as polygraphs: computability and complexity |
139
click to vote
ENTCS
2008
15 years 3 months ago
2008
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
146
Voted
IJET
2007
15 years 3 months ago
2007
Remarkable advances in instructional communication technology (ICT) have now made is possible to provide high levels of enrichment and the kinds of curricular differentiation that...
134
click to vote
ETS
2009
IEEE
15 years 1 months ago
2009
IEEE
We optimize the full-response diagnostic fault dictionary from a given test set. The smallest set of vectors is selected without loss of diagnostic resolution of the given test se...
129
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
132
Voted
GPEM
2008
15 years 3 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...