Sciweavers

1686 search results - page 253 / 338
» Programs as polygraphs: computability and complexity
Sort
View
131
Voted
ESWA
2006
148views more  ESWA 2006»
15 years 1 months ago
Applications of artificial intelligence in bioinformatics: A review
Artificial intelligence (AI) has increasingly gained attention in bioinformatics research and computational molecular biology. With the availability of different types of AI algor...
Zoheir Ezziane
111
Voted
SAC
2009
ACM
15 years 8 months ago
Remote software protection by orthogonal client replacement
In a typical client-server scenario, a trusted server provides valuable services to a client, which runs remotely on an untrusted platform. Of the many security vulnerabilities th...
Mariano Ceccato, Paolo Tonella, Mila Dalla Preda, ...
99
Voted
WMPI
2004
ACM
15 years 6 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
214
Voted
EH
1999
IEEE
351views Hardware» more  EH 1999»
15 years 5 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
107
Voted
PPOPP
1997
ACM
15 years 5 months ago
Performance Implications of Communication Mechanisms in All-Software Global Address Space Systems
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
Beng-Hong Lim, Chi-Chao Chang, Grzegorz Czajkowski...