Sciweavers

373 search results - page 27 / 75
» Mesh Association: Formulation and Algorithms
Sort
View
SMA
2009
ACM
117views Solid Modeling» more  SMA 2009»
15 years 4 months ago
Discrete physics using metrized chains
Over the last fifty years, there have been numerous efforts to develop from first principles a comprehensive discrete formulation of geometric physics, including Whitney’s ge...
Antonio DiCarlo, Franco Milicchio, Alberto Paoluzz...
BDIM
2008
IEEE
205views Business» more  BDIM 2008»
15 years 4 months ago
Mining semantic relations using NetFlow
—Knowing the dependencies among computing assets and services provides insights into the computing and business landscape, therefore, facilitating low-risk timely changes in supp...
Alexandru Caracas, Andreas Kind, Dieter Gantenbein...
DAC
1999
ACM
15 years 1 months ago
ENOR: Model Order Reduction of RLC Circuits Using Nodal Equations for Efficient Factorization
ENOR is an innovative way to produce provablypassive, reciprocal, and compact representations of RLC circuits. Beginning with the nodal equations, ENOR formulates recurrence relat...
Bernard N. Sheehan
4OR
2008
96views more  4OR 2008»
14 years 9 months ago
A column generation approach to train timetabling on a corridor
We propose heuristic and exact algorithms for the (periodic and non-periodic) train timetabling problem on a corridor that are based on the solution of the LP relaxation of an ILP...
Valentina Cacchiani, Alberto Caprara, Paolo Toth
ICPADS
2007
IEEE
15 years 4 months ago
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
Hoda Akbari, Zeinab Iranmanesh, Mohammad Ghodsi