Sciweavers

143 search results - page 11 / 29
» Diagnosis of Simple Temporal Networks
Sort
View
AIPS
2010
13 years 8 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
ACG
2003
Springer
14 years 25 days ago
Evaluation in Go by a Neural Network using Soft Segmentation
In this article a neural network architecture is presented that is able to build a soft segmentation of a two-dimensional input. This network architecture is applied to position ev...
Markus Enzenberger
ML
1998
ACM
136views Machine Learning» more  ML 1998»
13 years 7 months ago
Co-Evolution in the Successful Learning of Backgammon Strategy
Following Tesauro’s work on TD-Gammon, we used a 4000 parameter feed-forward neural network to develop a competitive backgammon evaluation function. Play proceeds by a roll of t...
Jordan B. Pollack, Alan D. Blair
P2P
2005
IEEE
14 years 1 months ago
Quantifying Agent Strategies under Reputation
Our research proposes a simple buyer/seller game that captures the incentives dictating the interaction between peers in resource trading peer-to-peer networks. We prove that for ...
Sergio Marti, Hector Garcia-Molina
NIPS
1996
13 years 9 months ago
Why did TD-Gammon Work?
Although TD-Gammon is one of the major successes in machine learning, it has not led to similar impressive breakthroughs in temporal difference learning for other applications or ...
Jordan B. Pollack, Alan D. Blair