Sciweavers

16404 search results - page 630 / 3281
» A set coverage problem
Sort
View
AUTOMATICA
2002
130views more  AUTOMATICA 2002»
15 years 7 months ago
Controllability and reachability criteria for switched linear systems
This paper investigates the controllability and reachability of switched linear control systems. It is proven that both the controllable and reachable sets are subspaces of the to...
Zhendong Sun, Shuzhi Sam Ge, Tong Heng Lee
DM
2002
82views more  DM 2002»
15 years 7 months ago
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
A basic problem in the design of mobile telephone networks is to assign sets of radio frequency bands (colours) to transmitters (vertices) to avoid interference. Often the transmi...
Frédéric Havet, Janez Zerovnik
ACSC
2005
IEEE
16 years 24 days ago
The Electronic Primaries: Predicting the U.S. Presidency Using Feature Selection with Safe Data Reduction
The data mining inspired problem of finding the critical, and most useful features to be used to classify a data set, and construct rules to predict the class of future examples ...
Pablo Moscato, Luke Mathieson, Alexandre Mendes, R...
NIPS
2003
15 years 8 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini
CORR
2008
Springer
136views Education» more  CORR 2008»
15 years 7 months ago
Multi-Armed Bandits in Metric Spaces
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal