Sciweavers

11565 search results - page 1961 / 2313
» Computing Minimal Mappings
Sort
View
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 10 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
NAA
2000
Springer
97views Mathematics» more  NAA 2000»
15 years 10 months ago
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
Igor Brainman, Sivan Toledo
200
Voted
ICCAD
1995
IEEE
180views Hardware» more  ICCAD 1995»
15 years 10 months ago
Design based analog testing by Characteristic Observation Inference
In this paper, a new approach to analog test design based on the circuit design process, called Characteristic Observation Inference (COI), is presented. In many situations, it is...
Walter M. Lindermeir, Helmut E. Graeb, Kurt Antrei...
DASFAA
2010
IEEE
213views Database» more  DASFAA 2010»
15 years 10 months ago
Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries
Abstract. Continuous monitoring of spatial queries has received significant research attention in the past few years. In this paper, we propose two efficient algorithms for the con...
Mahady Hasan, Muhammad Aamir Cheema, Wenyu Qu, Xue...
AAAI
2008
15 years 9 months ago
Efficient Haplotype Inference with Answer Set Programming
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. Although we have access to genotype data (gene...
Esra Erdem, Ferhan Türe
« Prev « First page 1961 / 2313 Last » Next »