Sciweavers

1628 search results - page 166 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
117
Voted
COMGEO
2010
ACM
15 years 3 months ago
Approximate centerpoints with proofs
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...
Gary L. Miller, Donald Sheehy
141
Voted
GECCO
2003
Springer
162views Optimization» more  GECCO 2003»
15 years 8 months ago
Optimization of Spare Capacity in Survivable WDM Networks
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
H. W. Chong, Sam Kwong
CAV
2005
Springer
129views Hardware» more  CAV 2005»
15 years 9 months ago
Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
Roberto Sebastiani, Stefano Tonetta, Moshe Y. Vard...
138
Voted
PAKDD
2004
ACM
94views Data Mining» more  PAKDD 2004»
15 years 9 months ago
Self-Similar Mining of Time Association Rules
Although the task of mining association rules has received considerable attention in the literature, algorithms to find time association rules are often inadequate, by either miss...
Daniel Barbará, Ping Chen, Zohreh Nazeri
INFSOF
2008
85views more  INFSOF 2008»
15 years 3 months ago
Locating dependence structures using search-based slicing
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
Tao Jiang, Nicolas Gold, Mark Harman, Zheng Li