Sciweavers

400 search results - page 26 / 80
» What Makes a Problem GP-Hard
Sort
View
IFL
2005
Springer
155views Formal Methods» more  IFL 2005»
14 years 3 months ago
A Binding Scope Analysis for Generic Programs on Arrays
Performance of generic array programs crucially relies on program specialization wrt. shape information. Traditionally, this is done in a rather adhoc fashion by propagating all sh...
Clemens Grelck, Sven-Bodo Scholz, Alexander V. Sha...
UML
2005
Springer
14 years 3 months ago
Use Cases, Actions, and Roles
Abstract. Use Cases are widely used for specifying systems, but their semantics are unclear in ways that make it difficult to apply use cases to complex problems. In this paper, we...
Guy Genilloud, William F. Frank, Gonzalo Gé...
ECAI
2004
Springer
14 years 3 months ago
Postponing Branching Decisions
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...
Willem Jan van Hoeve, Michela Milano
GI
2001
Springer
14 years 2 months ago
Private Information Retrieval
In e-commerce, the protection of user privacy from a server was not considered feasible until the private information retrieval (PIR) problem was stated recently. A PIR protocol a...
Dmitri Asonov
SPW
1999
Springer
14 years 2 months ago
The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks
In the near future, many personal electronic devices will be able to communicate with each other over a short range wireless channel. We investigate the principal security issues f...
Frank Stajano, Ross J. Anderson