Sciweavers

2875 search results - page 395 / 575
» Distributed Reactive Machines
Sort
View
COMPGEOM
2009
ACM
15 years 11 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
15 years 10 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
EUROCAST
2007
Springer
182views Hardware» more  EUROCAST 2007»
15 years 10 months ago
A k-NN Based Perception Scheme for Reinforcement Learning
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
José Antonio Martin H., Javier de Lope Asia...
JSSPP
2007
Springer
15 years 10 months ago
QBETS: Queue Bounds Estimation from Time Series
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
Daniel Nurmi, John Brevik, Richard Wolski
HICSS
2006
IEEE
163views Biometrics» more  HICSS 2006»
15 years 10 months ago
Learning Ranking vs. Modeling Relevance
The classical (ad hoc) document retrieval problem has been traditionally approached through ranking according to heuristically developed functions (such as tf.idf or bm25) or gene...
Dmitri Roussinov, Weiguo Fan