Sciweavers

7109 search results - page 452 / 1422
» Process Algebra with Combinators
Sort
View
ICS
2007
Tsinghua U.
16 years 1 months ago
Representation-transparent matrix algorithms with scalable performance
Positive results from new object-oriented tools for scientific programming are reported. Using template classes, abstractions of matrix representations are available that subsume...
Peter Gottschling, David S. Wise, Michael D. Adams
COMPGEOM
2006
ACM
16 years 25 days ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
16 years 12 days ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
ISMIS
2005
Springer
16 years 11 days ago
A Data Model Based on Paraconsistent Intuitionistic Fuzzy Relations
Abstract. Paraconsistent intuitionistic fuzzy set is an extension of intuitionistic fuzzy set or interval-valued fuzzy set. It relaxes the requirement that t + f ≤ 1, where t is ...
Haibin Wang, Rajshekhar Sunderraman
SPAA
2004
ACM
16 years 9 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter