Sciweavers

1220 search results - page 172 / 244
» Restricting grammatical complexity
Sort
View
KR
2010
Springer
14 years 23 days ago
Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
Ronen I. Brafman, Francesca Rossi, Domenico Salvag...
CHES
2001
Springer
130views Cryptology» more  CHES 2001»
14 years 15 days ago
Generating Elliptic Curves of Prime Order
A variation of the Complex Multiplication (CM) method for generating elliptic curves of known order over finite fields is proposed. We give heuristics and timing statistics in th...
Erkay Savas, Thomas A. Schmidt, Çetin Kaya ...
ICICS
2001
Springer
14 years 13 days ago
Enforcing Obligation with Security Monitors
With the ubiquitous deployment of large scale networks more and more complex human interactions are supported by computer applications. This poses new challenges on the expressive...
Carlos Ribeiro, Andre Zuquete, Paulo Ferreira
ICSE
2001
IEEE-ACM
14 years 13 days ago
Fast Formal Analysis of Requirements via "Topoi Diagrams"
Early testing of requirements can decrease the cost of removing errors in software projects. However, unless done carefully, that testing process can significantly add to the cos...
Tim Menzies, John D. Powell, Michael E. Houle
LCTRTS
2001
Springer
14 years 13 days ago
Designing an Efficient and Scalable Server-side Asynchrony Model for CORBA
When the Asynchronous Method Invocation (AMI) model was introduced into the CORBA specification, client applications benefited from the ability to invoke nonblocking two-way reque...
Darrell Brunsch, Carlos O'Ryan, Douglas C. Schmidt