13376 search results - page 289 / 2676 » Problem Solving with |
124
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
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...
138
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents a novel methodology to develop scheduling algorithms. The scheduling problem is phrased as a control problem, and control-theoretical techniques are used to de...
124
click to vote
TCBB
2008
15 years 3 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
129
click to vote
CEC
2010
IEEE
15 years 20 days ago
2010
IEEE
Multi-modal optimization refers to locating not only one optimum but a set of locally optimal solutions. Niching is an important technique to solve multi-modal optimization problem...
141
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Recently, several learning algorithms relying on models with deep architectures have been proposed. Though they have demonstrated impressive performance, to date, they have only b...