Sciweavers

16430 search results - page 918 / 3286
» On Computable Tree Functions
Sort
View
COCO
2005
Springer
153views Algorithms» more  COCO 2005»
16 years 1 months ago
Average-Case Computations - Comparing AvgP, HP, and Nearly-P
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
Arfst Nickelsen, Birgit Schelm
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
16 years 1 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
ATAL
2004
Springer
16 years 1 months ago
Communication for Improving Policy Computation in Distributed POMDPs
Distributed Partially Observable Markov Decision Problems (POMDPs) are emerging as a popular approach for modeling multiagent teamwork where a group of agents work together to joi...
Ranjit Nair, Milind Tambe, Maayan Roth, Makoto Yok...
LCPC
2001
Springer
16 years 4 days ago
Computing Array Shapes in MATLAB
This paper deals with the problem of statically inferring the shape of an array in languages such as MATLAB. Inferring an array’s shape is desirable because it empowers better co...
Pramod G. Joisha, U. Nagaraj Shenoy, Prithviraj Ba...
213
Voted
EWLR
1997
Springer
15 years 12 months ago
Learning Complex Robot Behaviours by Evolutionary Computing with Task Decomposition
Building robots can be a tough job because the designer has to predict the interactions between the robot and the environment as well as to deal with them. One solution to cope the...
Wei-Po Lee, John Hallam, Henrik Hautop Lund