Sciweavers

3907 search results - page 276 / 782
» Time, Knowledge, and Choice
Sort
View
DAGSTUHL
2004
15 years 8 months ago
Removing Cycles in Esterel Programs
Abstract. Synchronous programs may contain cyclic signal interdependencies. This prohibits a static scheduling, which limits the choice of available compilation techniques for such...
Jan Lukoschus, Reinhard von Hanxleden
AIPS
2000
15 years 8 months ago
Planning with Conflicting Advice
The paradigm of advisable planning, in which a user provides guidance to influence the content of solutions produced by an underlying planning system, holds much promise for impro...
Karen L. Myers
ISMB
1996
15 years 8 months ago
Compact Encoding Strategies for DNA Sequence Similarity Search
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
David J. States, Pankaj Agarwal
ICASSP
2010
IEEE
15 years 6 months ago
Using cross-decoder phone coocurrences in phonotactic language recognition
Phonotactic language recognizers are based on the ability of phone decoders to produce phone sequences containing acoustic, phonetic and phonological information, which is partial...
Mikel Peñagarikano, Amparo Varona, Luis Jav...
168
Voted
CORR
2008
Springer
227views Education» more  CORR 2008»
15 years 6 months ago
An experimental analysis of Lemke-Howson algorithm
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
Bruno Codenotti, Stefano De Rossi, Marino Pagan