Sciweavers

52 search results - page 5 / 11
» Computing Minimal Diagnoses by Greedy Stochastic Search
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Using counterfactual regret minimization to create competitive multiplayer poker agents
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
Nicholas Abou Risk, Duane Szafron
SADM
2010
173views more  SADM 2010»
13 years 2 months ago
Data reduction in classification: A simulated annealing based projection method
This paper is concerned with classifying high dimensional data into one of two categories. In various settings, such as when dealing with fMRI and microarray data, the number of v...
Tian Siva Tian, Rand R. Wilcox, Gareth M. James
IJCNN
2007
IEEE
14 years 1 months ago
TRUST-TECH Based Neural Network Training
— Efficient Training in a neural network plays a vital role in deciding the network architecture and the accuracy of these classifiers. Most popular local training algorithms t...
Hsiao-Dong Chiang, Chandan K. Reddy
SPAA
1996
ACM
13 years 11 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
14 years 2 months ago
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Thierry Benoist, Bertrand Estellon, Fréd&ea...