Sciweavers

3628 search results - page 136 / 726
» Approaching the Physical Limits of Computing
Sort
View
CP
2003
Springer
15 years 3 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
EUROCRYPT
2007
Springer
15 years 4 months ago
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
Jonathan Katz
BMCBI
2010
110views more  BMCBI 2010»
14 years 10 months ago
Discovering local patterns of co - evolution: computational aspects and biological examples
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
Tamir Tuller, Yifat Felder, Martin Kupiec
IJCAI
1989
14 years 11 months ago
Using and Refining Simplifications: Explanation-Based Learning of Plans in Intractable Domains
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
Steve A. Chien
HPCN
1995
Springer
15 years 1 months ago
Exploiting massively parallel architectures for the solution of diffusion and propagation problems
Many problems in several fields like physics, chemistry, biology and engineering lack an analytical solution able to provide a satisfactory phenomena description. Then a numerical...
P. P. Delsanto, S. Biancotto, M. Scalerandi, Mauri...