Sciweavers

2314 search results - page 180 / 463
» Monoids over domains
Sort
View
AIPS
1994
15 years 3 months ago
Toward a Plan Steering Agent: Experiments with Schedule Maintenance
When a plan involves hundreds or thousands of events over time it can be di cult or impossible to tell whether those events are unfolding \according to plan" and to assess th...
Tim Oates, Paul R. Cohen
AIPS
2009
15 years 3 months ago
Lower Bounding Klondike Solitaire with Monte-Carlo Planning
Despite its ubiquitous presence, very little is known about the odds of winning the simple card game of Klondike Solitaire. The main goal of this paper is to investigate the use o...
Ronald Bjarnason, Alan Fern, Prasad Tadepalli
CVPR
2010
IEEE
15 years 2 months ago
Boosting for transfer learning with multiple sources
Transfer learning allows leveraging the knowledge of source domains, available a priori, to help training a classifier for a target domain, where the available data is scarce. Th...
Yi Yao, Gianfranco Doretto
AAMAS
2006
Springer
15 years 2 months ago
Handling Communication Restrictions and Team Formation in Congestion Games
Abstract. There are many domains in which a multi-agent system needs to maximize a "system utility" function which rates the performance of the entire system, while subje...
Adrian K. Agogino, Kagan Tumer
EAAI
2008
101views more  EAAI 2008»
15 years 2 months ago
A global constraint for total weighted completion time for cumulative resources
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
András Kovács, J. Christopher Beck