Sciweavers

699 search results - page 100 / 140
» The method of combinatorial telescoping
Sort
View
AI
2000
Springer
15 years 12 days ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...
103
Voted
RAS
2002
129views more  RAS 2002»
15 years 6 days ago
Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun
101
Voted
TCS
2010
14 years 11 months ago
Maximum likelihood analysis of algorithms and data structures
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
Ulrich Laube, Markus E. Nebel
102
Voted
CJ
2010
134views more  CJ 2010»
14 years 10 months ago
Designing Effective Policies for Minimal Agents
A policy for a minimal reactive agent is a set of condition-action rules used to determine its response to perceived environmental stimuli. When the policy pre-disposes the agent t...
Krysia Broda, Christopher J. Hogger
120
Voted
GECCO
2010
Springer
189views Optimization» more  GECCO 2010»
14 years 10 months ago
Multiobjective evolutionary algorithm for software project portfolio optimization
Large software companies have to plan their project portfolio to maximize potential portfolio return and strategic alignment, while balancing various preferences, and considering ...
Thomas Kremmel, Jirí Kubalík, Stefan...