Sciweavers

2490 search results - page 377 / 498
» Complexity of Contextual Reasoning
Sort
View
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 7 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
MCS
2000
Springer
15 years 7 months ago
Combining Fisher Linear Discriminants for Dissimilarity Representations
Abstract Investigating a data set of the critical size makes a classification task difficult. Studying dissimilarity data refers to such a problem, since the number of samples equa...
Elzbieta Pekalska, Marina Skurichina, Robert P. W....
ICCAD
1995
IEEE
180views Hardware» more  ICCAD 1995»
15 years 7 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...
150
Voted
FM
1991
Springer
164views Formal Methods» more  FM 1991»
15 years 7 months ago
Formalizing Design Spaces: Implicit Invocation Mechanisms
An important goal of software engineering is to exploit commonalities in system design in order to reduce the complexity of building new systems, support largescale reuse, and pro...
David Garlan, David Notkin
156
Voted
HT
1991
ACM
15 years 7 months ago
Identifying Aggregates in Hypertext Structures
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
Rodrigo A. Botafogo, Ben Shneiderman