Sciweavers

3656 search results - page 141 / 732
» Compact Location Problems
Sort
View
95
Voted
AIPS
2007
15 years 3 months ago
Discovering Relational Domain Features for Probabilistic Planning
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
Jia-Hong Wu, Robert Givan
AIPS
2008
15 years 3 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
132
Voted
CEC
2005
IEEE
15 years 2 months ago
XCS with computed prediction in continuous multistep environments
We apply XCS with computed prediction (XCSF) to tackle multistep reinforcement learning problems involving continuous inputs. In essence we use XCSF as a method of generalized rein...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...
96
Voted
ECAI
2010
Springer
15 years 1 months ago
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
Sylvain Bouveret, Ulle Endriss, Jérôm...
ICCAD
1999
IEEE
86views Hardware» more  ICCAD 1999»
15 years 5 months ago
A framework for testing core-based systems-on-a-chip
Available techniques for testing core-based systems-on-a-chip (SOCs) do not provide a systematic means for synthesising low-overhead test architectures and compact test solutions....
Srivaths Ravi, Ganesh Lakshminarayana, Niraj K. Jh...