Sciweavers

2479 search results - page 374 / 496
» Random Event Structures
Sort
View
JSAT
2008
113views more  JSAT 2008»
13 years 10 months ago
Combining Adaptive and Dynamic Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
JGAA
2007
135views more  JGAA 2007»
13 years 10 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
TVLSI
2008
140views more  TVLSI 2008»
13 years 10 months ago
A Novel Mutation-Based Validation Paradigm for High-Level Hardware Descriptions
We present a Mutation-based Validation Paradigm (MVP) technology that can handle complete high-level microprocessor implementations and is based on explicit design error modeling, ...
Jorge Campos, Hussain Al-Asaad
TWC
2008
184views more  TWC 2008»
13 years 10 months ago
Distributed Space-Frequency Coding over Broadband Relay Channels
Abstract--Designing diversity achieving schemes over the wireless broadband fading relay channels is crucial to achieve higher diversity gains. These gains are achieved by exploiti...
Karim G. Seddik, K. J. Ray Liu
DAM
2000
137views more  DAM 2000»
13 years 10 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...