Sciweavers

414 search results - page 69 / 83
» On discrete norms of polynomials
Sort
View
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 11 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
13 years 11 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau
UAI
2000
13 years 11 months ago
PEGASUS: A policy search method for large MDPs and POMDPs
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
Andrew Y. Ng, Michael I. Jordan
ATAL
2010
Springer
13 years 11 months ago
To teach or not to teach?: decision making under uncertainty in ad hoc teams
In typical multiagent teamwork settings, the teammates are either programmed together, or are otherwise provided with standard communication languages and coordination protocols. ...
Peter Stone, Sarit Kraus
CORR
2008
Springer
162views Education» more  CORR 2008»
13 years 10 months ago
Compressed Modular Matrix Multiplication
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy