Sciweavers

5329 search results - page 412 / 1066
» The Weighted Majority Algorithm
Sort
View
JCO
2010
182views more  JCO 2010»
15 years 5 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
EVOW
2009
Springer
15 years 4 months ago
Conquering the Needle-in-a-Haystack: How Correlated Input Variables Beneficially Alter the Fitness Landscape for Neural Networks
Abstract. Evolutionary algorithms such as genetic programming and grammatical evolution have been used for simultaneously optimizing network architecture, variable selection, and w...
Stephen D. Turner, Marylyn D. Ritchie, William S. ...
OL
2011
242views Neural Networks» more  OL 2011»
15 years 1 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
TWC
2010
15 years 1 months ago
Closed-Loop Transmit Diversity with Imperfect Feedback
The closed-loop transmit diversity technique is used to improve the performance of the downlink channel in MIMO communication systems. In these closed-loop systems, feedback delay...
A. Heidari, Amir K. Khandani
ICALP
2011
Springer
14 years 10 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner