65 search results - page 1 / 13 » Maximum Marking Problems with Accumulative Weight Functions |
ICTAC
2005
Springer
13 years 10 months ago
2005
Springer
We present a new derivation of eļ¬cient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the speciļ...
AIPS
2006
13 years 6 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
SNPD
2003
13 years 6 months ago
2003
This paper introduces accumulation into list homomorphisms for systematic development of both efļ¬cient and correct parallel programs. New parallelizable recursive pattern called...
AAIM
2007
Springer
13 years 11 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E ā Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
CORR
2010
Springer
12 years 12 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...