Sciweavers

594 search results - page 44 / 119
» A Note on Concepts and Distances
Sort
View
ENDM
2010
115views more  ENDM 2010»
13 years 5 months ago
On the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
Matteo Fischetti, Andrea Lodi
BMCBI
2010
121views more  BMCBI 2010»
13 years 7 months ago
Reconstructing genome trees of prokaryotes using overlapping genes
Background: Overlapping genes (OGs) are defined as adjacent genes whose coding sequences overlap partially or entirely. In fact, they are ubiquitous in microbial genomes and more ...
Chih-Hsien Cheng, Chung-Han Yang, Hsien-Tai Chiu, ...
EDBT
2008
ACM
178views Database» more  EDBT 2008»
14 years 7 months ago
An inductive database and query language in the relational model
In the demonstration, we will present the concepts and an implementation of an inductive database ? as proposed by Imielinski and Mannila ? in the relational model. The goal is to...
Lothar Richter, Jörg Wicker, Kristina Kessler...
ISPAN
2002
IEEE
14 years 19 days ago
Fault-Tolerant Routing on the Star Graph with Safety Vectors
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...
Sheng-I Yeh, Chang-Biau Yang, Hon-Chan Chen
ICPADS
2000
IEEE
13 years 11 months ago
Optimal Fault-Tolerant Routing in Hypercubes Using Extended Safety Vectors
1 Reliable communication in cube-based multicomputers using the extended safety vector concept is studied in this paper. In our approach, each node in a cube-based multicomputer o...
Jie Wu, Feng Gao, Zhongcheng Li, Yinghua Min