Sciweavers

4865 search results - page 558 / 973
» The Complexity of Graph Connectivity
Sort
View
AAAI
2007
15 years 9 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel
ASPDAC
2008
ACM
74views Hardware» more  ASPDAC 2008»
15 years 9 months ago
Large-scale fixed-outline floorplanning design using convex optimization techniques
A two-stage optimization methodology is proposed to solve the fixed-outline floorplanning problem that is a global optimization problem for wirelength minimization. In the first st...
Chaomin Luo, Miguel F. Anjos, Anthony Vannelli
CSCWD
2005
Springer
15 years 8 months ago
The structure representation for the concurrent analysis of product assembly and disassembly
This paper presents a simple and novel structure representation supporting the assembly and disassembly planning of electromechanical products. The proposed Relationship Matrix de...
Jyh-Cheng Yu, Yi-Ming Li
187
Voted
EKAW
2006
Springer
15 years 8 months ago
A Formal Approach to Qualitative Reasoning on Topological Properties of Networks
Abstract. Qualitative reasoning uses a limited set of relevant distinctions of the domain to allow a flexible way of representing and reasoning about it. This work presents a conce...
Andrea Rodríguez, Claudio Gutierrez
CCCG
2007
15 years 8 months ago
On a Geometric Approach to the Segment Sum Problem and Its Generalization
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
Asish Mukhopadhyay, Eugene Greene