Sciweavers

14386 search results - page 346 / 2878
» The Chinese Generals Problem
Sort
View
STRINGOLOGY
2004
15 years 7 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
ISMB
1997
15 years 7 months ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey
IJCAI
1993
15 years 7 months ago
A Tractable Class of Abduction Problems
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
Kave Eshghi
IAJIT
2008
319views more  IAJIT 2008»
15 years 6 months ago
Diagnosis of Distillation Column Problems Using New Generation Gamma-Ray Scanning Gauge
: The Gamma-Ray scanning technique effective means for the diagnosis and identification of installations and process's problems in general and in particular in the case of dis...
Khalid Laraki, Rachad Alami, Rajaa El Morsli, Abde...
CORR
2006
Springer
144views Education» more  CORR 2006»
15 years 6 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro