Sciweavers

1399 search results - page 81 / 280
» New Algorithms for k-Center and Extensions
Sort
View
DATE
1998
IEEE
165views Hardware» more  DATE 1998»
14 years 1 months ago
AGENDA: An Attribute Grammar Driven Environment for the Design Automation of Digital Systems
Attribute grammars have been used extensively in every phase of traditional compiler construction. Recently, it has been shown that they can also be effectively adopted to handle ...
George Economakos, George K. Papakonstantinou, Pan...
COLT
1991
Springer
14 years 19 days ago
Improved Learning of AC0 Functions
Two extensions of the Linial, Mansour, Nisan AC0 learning algorithm are presented. The LMN method works when input examples are drawn uniformly. The new algorithmsimprove on their...
Merrick L. Furst, Jeffrey C. Jackson, Sean W. Smit...
UAI
2008
13 years 10 months ago
Estimation and clustering with infinite rankings
This paper presents a natural extension of stagewise ranking to the the case of infinitely many items. We introduce the infinite generalized Mallows model (IGM), describe its prop...
Marina Meila, Le Bao
ICML
2010
IEEE
13 years 10 months ago
Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled Trial Analysis
We introduce new, efficient algorithms for value iteration with multiple reward functions and continuous state. We also give an algorithm for finding the set of all nondominated a...
Daniel J. Lizotte, Michael H. Bowling, Susan A. Mu...
KI
2008
Springer
13 years 9 months ago
Symbolic Classification of General Two-Player Games
Abstract. In this paper we present a new symbolic algorithm for the classification, i. e. the calculation of the rewards for both players in case of optimal play, of two-player gam...
Stefan Edelkamp, Peter Kissmann