Sciweavers

2254 search results - page 68 / 451
» Computing the minimal covering set
Sort
View
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
14 years 1 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
JCC
2008
85views more  JCC 2008»
13 years 10 months ago
Minimal molecular surfaces and their applications
Abstract: This article presents a novel concept, the minimal molecular surface (MMS), for the theoretical modeling of biomolecules. The MMS can be viewed as a result of the surface...
P. W. Bates, G. W. Wei, Shan Zhao
JDCTA
2010
228views more  JDCTA 2010»
13 years 4 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang
ICFP
2008
ACM
14 years 10 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
ICALP
2009
Springer
14 years 10 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...