Sciweavers

1753 search results - page 319 / 351
» State Machines
Sort
View
BMCBI
2008
112views more  BMCBI 2008»
14 years 10 months ago
A simplified approach to disulfide connectivity prediction from protein sequences
Background: Prediction of disulfide bridges from protein sequences is useful for characterizing structural and functional properties of proteins. Several methods based on differen...
Marc Vincent, Andrea Passerini, Matthieu Labb&eacu...
ENTCS
2006
97views more  ENTCS 2006»
14 years 10 months ago
VyrdMC: Driving Runtime Refinement Checking with Model Checkers
This paper presents VyrdMC, a runtime verification tool we are building for concurrent software components. The correctness criterion checked by VyrdMC is refinement: Each executi...
Tayfun Elmas, Serdar Tasiran
CORR
2007
Springer
144views Education» more  CORR 2007»
14 years 10 months ago
Optimization of Information Rate Upper and Lower Bounds for Channels with Memory
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams
IJFCS
2007
105views more  IJFCS 2007»
14 years 10 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean
JAIR
2011
134views more  JAIR 2011»
14 years 4 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...