Satisficing and Bounded Optimality

First Page		Document Content
Date: 2006-01-11 05:34:49 Ethology Artificial intelligence Operations research Organizational behavior Satisficing Search algorithms Anytime algorithm Mathematical optimization Rationality Science Cognitive science Heuristics		Satisficing and Bounded Optimality Add to Reading List Source URL: www.aaai.org Download Document from Source Website File Size: 379,27 KB Share Document on Facebook

	Regret Analysis of the Anytime Optimally Confident UCB Algorithm Tor Lattimore Department of Computing Science University of Alberta, Canada DocID: 1t8nK - View Document
	Deterministic Anytime Inference for Stochastic Continuous-Time Markov Processes E. Busra Celikkaya University of California, Riverside CELIKKAE @ CS . UCR . EDU DocID: 1r3Cm - View Document
	Genome Informatics 12: 73–A Multi-Queue Branch-and-Bound Algorithm for Anytime Optimal Search DocID: 1pVtk - View Document
	A Distributed Anytime Algorithm for Dynamic Task Allocation in Multi-Agent Systems Kathryn S. Macarthur, Ruben Stranders, Sarvapali D. Ramchurn and Nicholas R. Jennings {ksm08r,rs2,sdr,nrj}@ecs.soton.ac.uk School of Elec DocID: 1nFKt - View Document
	A Complete Anytime Algorithm for Treewidth Vibhav Gogate and Rina Dechter School of Information and Computer Science, University of California, Irvine, CA 92967 {vgogate,dechter}@ics.uci.edu DocID: 1ktBM - View Document