Sciweavers

DM
1999
109views more  DM 1999»
13 years 11 months ago
Hamiltonian powers in threshold and arborescent comparability graphs
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
Sam Donnelly, Garth Isaak
AAAI
1994
14 years 24 days ago
Evolving Neural Networks to Focus Minimax Search
Neural networks were evolved through genetic algorithms to focus minimax search in the game of Othello. At each level of the search tree, the focus networks decide which moves are...
David E. Moriarty, Risto Miikkulainen
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
14 years 3 months ago
Adaptive minimax filtering via recursive optimal quadratic approximations
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
S. Gollamudi, Yih-Fang Huang
PODS
2010
ACM
184views Database» more  PODS 2010»
14 years 4 months ago
Universally optimal privacy mechanisms for minimax agents
A scheme that publishes aggregate information about sensitive data must resolve the trade-off between utility to information consumers and privacy of the database participants. D...
Mangesh Gupte, Mukund Sundararajan
ACG
2003
Springer
14 years 4 months ago
Search versus Knowledge: An Empirical Study of Minimax on KRK
This article presents the results of an empirical experiment designed to gain insight into what is the effect of the minimax algorithm on the evaluation function. The experiment’...
Aleksander Sadikov, Ivan Bratko, Igor Kononenko