Sciweavers

36 search results - page 2 / 8
» Approximation Schemes for First-Order Definable Optimisation...
Sort
View
ANTSW
2006
Springer
13 years 9 months ago
Kernelization as Heuristic Structure for the Vertex Cover Problem
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
Stephen Gilmour, Mark Dras
MOC
2002
127views more  MOC 2002»
13 years 5 months ago
The dynamical behavior of the discontinuous Galerkin method and related difference schemes
We study the dynamical behavior of the discontinuous Galerkin finite element method for initial value problems in ordinary differential equations. We make two different assumptions...
Donald J. Estep, Andrew M. Stuart
CEC
2009
IEEE
13 years 3 months ago
Multi-objective Combinatorial Optimisation with Coincidence algorithm
-- Most optimization algorithms that use probabilistic models focus on extracting the information from good solutions found in the population. A selection method discards the below...
Warin Wattanapornprom, Panuwat Olanviwitchai, Para...
SEC
2000
13 years 6 months ago
Improving Packet Filters Management through Automatic and Dynamic Schemes
: The development of complex access control architectures raises the problem of their management. In this article, we describe an architecture providing packet filters configuratio...
Olivier Paul, Maryline Laurent
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
13 years 9 months ago
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
Eamonn J. Keogh, Michael J. Pazzani