Sciweavers

1258 search results - page 237 / 252
» Architecture-driven Problem Decomposition
Sort
View
SIGIR
2009
ACM
14 years 2 months ago
Fast nonparametric matrix factorization for large-scale collaborative filtering
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
Kai Yu, Shenghuo Zhu, John D. Lafferty, Yihong Gon...
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 1 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
PROMAS
2004
Springer
14 years 27 days ago
Coordinating Teams in Uncertain Environments: A Hybrid BDI-POMDP Approach
Distributed partially observable Markov decision problems (POMDPs) have emerged as a popular decision-theoretic approach for planning for multiagent teams, where it is imperative f...
Ranjit Nair, Milind Tambe
ATAL
2003
Springer
14 years 23 days ago
Role allocation and reallocation in multiagent teams: towards a practical analysis
Despite the success of the BDI approach to agent teamwork, initial role allocation (i.e. deciding which agents to allocate to key roles in the team) and role reallocation upon fai...
Ranjit Nair, Milind Tambe, Stacy Marsella
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
14 years 14 days ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick