Sciweavers

1160 search results - page 193 / 232
» Revisiting the Sequence Constraint
Sort
View
MFCS
1995
Springer
15 years 9 months ago
Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
Osamu Maruyama, Satoru Miyano
CIE
2008
Springer
15 years 8 months ago
Effective Dimensions and Relative Frequencies
Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet that satisfy some given condition P on the asympt...
Xiaoyang Gu, Jack H. Lutz
CODES
2008
IEEE
15 years 8 months ago
Software optimization for MPSoC: a mpeg-2 decoder case study
Using traditional software profiling to optimize embedded software in an MPSoC design is not reliable. With multiple processors running concurrently and programs interacting, trad...
Eric Cheung, Harry Hsieh, Felice Balarin
EWCBR
2008
Springer
15 years 8 months ago
Competence-Preserving Case-Deletion Strategy for Case Base Maintenance
The main goal of a Case-Based Reasoning (CBR) system is to provide criteria for evaluating the internal behavior and task efficiency of a particular system for a given initial case...
Mohamed Karim Haouchine, Brigitte Chebel-Morello, ...
FM
2008
Springer
75views Formal Methods» more  FM 2008»
15 years 7 months ago
Masking Faults While Providing Bounded-Time Phased Recovery
We focus on synthesis techniques for transforming existing fault-intolerant real-time programs to fault-tolerant programs that provide phased recovery. A fault-tolerant program is ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni