Sciweavers

9532 search results - page 1766 / 1907
» Logic, Graphs, and Algorithms
Sort
View
CAISE
2004
Springer
15 years 3 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
15 years 3 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir
ICTAI
2000
IEEE
15 years 3 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
KONVENS
2000
15 years 3 months ago
The RWTH Large Vocabulary Speech Recognition System for Spontaneous Speech
This paper presents details of the RWTH large vocabulary continuous speech recognition system used in the VERBMOBIL spontaneous speech translation system. In particular, we report...
Stephan Kanthak, Sirko Molau, Achim Sixtus, Ralf S...
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
15 years 3 months ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling
« Prev « First page 1766 / 1907 Last » Next »