387 search results - page 50 / 78 » Many Random Walks Are Faster Than One |
AIPS
2006
13 years 10 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
IJCAI
2001
13 years 10 months ago
2001
Most formulations of Reinforcement Learning depend on a single reinforcement reward value to guide the search for the optimal policy solution. If observation of this reward is rar...
WSCG
2003
13 years 10 months ago
2003
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...
BIOSYSTEMS
2007
13 years 9 months ago
2007
Alternative pathways through a gene regulation network connect a regulatory molecule to its (indirect) regulatory target via different intermediate regulators. We here show for tw...
JUCS
2008
13 years 9 months ago
2008
: Authoring ITS domain models is a difficult task requiring many skills. We explored whether modeling ontology reduces the problem by giving the students of an e-learning summer sc...