Sciweavers

451 search results - page 64 / 91
» On Parameterized Exponential Time Complexity
Sort
View
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 11 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
COMPGEOM
2008
ACM
13 years 11 months ago
Towards persistence-based reconstruction in euclidean spaces
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
Frédéric Chazal, Steve Oudot
CAMP
2005
IEEE
14 years 3 months ago
Virtual Astronomy, Information Technology, and the New Scientific Methodology
—All sciences, including astronomy, are now entering the era of information abundance. The exponentially increasing volume and complexity of modern data sets promises to transfor...
S. George Djorgovski
AAAI
2006
13 years 11 months ago
Approximate Compilation for Embedded Model-based Reasoning
The use of embedded technology has become widespread. Many complex engineered systems comprise embedded features to perform self-diagnosis or self-reconfiguration. These features ...
Barry O'Sullivan, Gregory M. Provan
TSP
2010
13 years 4 months ago
Markov chain monte carlo detectors for channels with intersymbol interference
In this paper, we propose novel low-complexity soft-in soft-out (SISO) equalizers using the Markov chain Monte Carlo (MCMC) technique. We develop a bitwise MCMC equalizer (b-MCMC) ...
Ronghui Peng, Rong-Rong Chen, Behrouz Farhang-Boro...