Sciweavers

726 search results - page 36 / 146
» Recent advances in computational models of natural argument
Sort
View
119
Voted
ENTCS
2006
176views more  ENTCS 2006»
15 years 19 days ago
Gauss: A Framework for Verifying Scientific Computing Software
High performance scientific computing software is of critical international importance as it supports scientific explorations and engineering. Software development in this area is...
Robert Palmer, Steve Barrus, Yu Yang, Ganesh Gopal...
LICS
2008
IEEE
15 years 7 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
94
Voted
JSAC
2007
139views more  JSAC 2007»
15 years 15 days ago
Reverse-Engineering MAC: A Non-Cooperative Game Model
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
Jang-Won Lee, Ao Tang, Jianwei Huang, Mung Chiang,...
88
Voted
SC
2004
ACM
15 years 6 months ago
Will Moore's Law Be Sufficient?
—It seems well understood that supercomputer simulation is an enabler for scientific discoveries, weapons, and other activities of value to society. It also seems widely believed...
Erik DeBenedictis
GRAMMARS
2002
119views more  GRAMMARS 2002»
15 years 12 days ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an