Sciweavers

12950 search results - page 509 / 2590
» On Optimal Timed Strategies
Sort
View
AUSAI
2005
Springer
16 years 21 days ago
K-Optimal Pattern Discovery: An Efficient and Effective Approach to Exploratory Data Mining
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
Geoffrey I. Webb
GECCO
1999
Springer
130views Optimization» more  GECCO 1999»
15 years 11 months ago
Heterochrony and Adaptation in Developing Neural Networks
This paper discusses the simulation results of a model of biological development for neural networks based on a regulatory genome. The model’s results are analyzed using the fra...
Angelo Cangelosi
GLOBECOM
2010
IEEE
15 years 5 months ago
Column Generation for Dimensioning Resilient Optical Grid Networks with Relocation
Nowadays, the Quality of Service (QoS) in Optical Grids has become a key issue. An important QoS factor is the resiliency, namely the ability to survive from certain network failur...
Brigitte Jaumard, Jens Buysse, Ali Shaikh, Marc De...
WADS
2007
Springer
165views Algorithms» more  WADS 2007»
16 years 1 months ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
Matthias Müller-Hannemann, Siamak Tazari
WADS
2007
Springer
184views Algorithms» more  WADS 2007»
16 years 1 months ago
A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanj...