Sciweavers

9842 search results - page 323 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
NDSS
2003
IEEE
15 years 9 months ago
Traps and Pitfalls: Practical Problems in System Call Interposition Based Security Tools
System call interposition is a powerful method for regulating and monitoring application behavior. In recent years, a wide variety of security tools have been developed that use t...
Tal Garfinkel
ICCBR
2009
Springer
15 years 8 months ago
Determining Root Causes of Drilling Problems by Combining Cases and General Knowledge
Oil well drilling is a complex process which frequently leads to operational problems. In order to deal with some of these problems, knowledge intensive case based reasoning (KiCBR...
Samad Valipour Shokouhi, Agnar Aamodt, Pål S...
LATA
2010
Springer
15 years 10 months ago
Choosing Word Occurrences for the Smallest Grammar Problem
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
Rafael Carrascosa, François Coste, Matthias...
CSL
2009
Springer
15 years 10 months ago
Decision Problems for Nash Equilibria in Stochastic Games
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
Michael Ummels, Dominik Wojtczak
124
Voted
DNA
2009
Springer
185views Bioinformatics» more  DNA 2009»
15 years 10 months ago
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
Knowledge of energy barriers between pairs of secondary structures for a given DNA or RNA molecule is useful, both in understanding RNA function in biological settings and in desig...
Ján Manuch, Chris Thachuk, Ladislav Stacho,...