Sciweavers

5372 search results - page 234 / 1075
» complexity 2007
Sort
View
122
Voted
ACSW
2006
15 years 3 months ago
Formal analysis of secure contracting protocol for e-tendering
Formal specification and verification of protocols have been credited for uncovering protocol flaws; revealing inadequacies in protocol design of the Initial Stage and Negotiation...
Rong Du, Ernest Foo, Colin Boyd, Kim-Kwang Raymond...
126
Voted
CDES
2006
98views Hardware» more  CDES 2006»
15 years 3 months ago
Instruction Fetch Energy Reduction Using Forward-Branch Bufferable Innermost Loop Buffer
Recently, several loop buffer designs have been proposed to reduce instruction fetch energy due to size and location advantage of loop buffer. Nevertheless, on design complexity di...
Bin-Hua Tein, I-Wei Wu, Chung-Ping Chung
122
Voted
ACL
1998
15 years 3 months ago
A Test Environment for Natural Language Understanding Systems
The Natural Language Understanding Engine Test Environment (ETE) is a GUI software tool that aids in the development and maintenance of large, modular, natural language understand...
Li Li, Deborah A. Dahl, Lewis M. Norton, Marcia C....
106
Voted
IJCAI
1993
15 years 3 months ago
On the Polynomial Transparency of Resolution
In this paper a framework is developed for measuring the complexities of deductions in an ab­ stract and computationally perspicuous man­ ner. As a notion of central importance ...
Reinhold Letz
124
Voted
EJC
2006
15 years 2 months ago
Counting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
Remco van der Hofstad, Joel Spencer