Sciweavers

9359 search results - page 503 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
COMPGEOM
2010
ACM
15 years 12 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar
SPAA
2010
ACM
15 years 11 months ago
Flat combining and the synchronization-parallelism tradeoff
Traditional data structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. We introduce a new synchronization paradi...
Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr...
EDBT
2010
ACM
141views Database» more  EDBT 2010»
15 years 11 months ago
Adaptive join processing in pipelined plans
In adaptive query processing, the way in which a query is evaluated is changed in the light of feedback obtained from the environment during query evaluation. Such feedback may, f...
Kwanchai Eurviriyanukul, Norman W. Paton, Alvaro A...
181
Voted
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
15 years 11 months ago
Fitting multi-planet transit models to photometric time-data series by evolution strategies
In this paper we present the application of an evolution strategy to the problem of detecting multi-planet transit events in photometric time-data series. Planetary transits occur...
Andreas M. Chwatal, Günther R. Raidl, Michael...
GECCO
2010
Springer
210views Optimization» more  GECCO 2010»
15 years 11 months ago
Biogeography-based optimization of neuro-fuzzy system parameters for diagnosis of cardiac disease
Cardiomyopathy refers to diseases of the heart muscle that becomes enlarged, thick, or rigid. These changes affect the electrical stability of the myocardial cells, which in turn ...
Mirela Ovreiu, Dan Simon