Sciweavers

51 search results - page 6 / 11
» On a universal best choice algorithm for partially ordered s...
Sort
View
AIPS
2004
13 years 9 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
WINE
2009
Springer
138views Economy» more  WINE 2009»
14 years 2 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 7 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
IJCAI
2007
13 years 9 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
SI3D
2010
ACM
14 years 2 months ago
Assisted texture assignment
Virtual environments are typically textured by manually choosing an image to apply on each surface. This implies browsing through large sets of generic textures for each and every...
Matthäus G. Chajdas, Sylvain Lefebvre, Marc S...