3378 search results - page 583 / 676 » A universe of binding and computation |
166
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
167
click to vote
FCT
2009
Springer
16 years 26 days ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
129
click to vote
IPPS
2008
IEEE
16 years 21 days ago
2008
IEEE
Cosmological simulators are an important component in the study of the formation of galaxies and large scale structures, and can help answer many important questions about the uni...
167
click to vote
ITNG
2008
IEEE
16 years 21 days ago
2008
IEEE
We propose a hierarchy-driven approach to facilitate student learning and foster a deeper understanding of the importance of attack patterns in computer, network, and software sec...
201
click to vote
VLSID
2008
IEEE
16 years 20 days ago
2008
IEEE
The last decade has seen a phenomenal increase in the use of electronic components in automotive systems, resulting in the replacement of purely mechanical or hydraulic-implementa...