Sciweavers

2488 search results - page 414 / 498
» An improvement in formal verification
Sort
View
IJCAI
2001
15 years 2 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
WSC
2004
15 years 2 months ago
Exploring Agent-Supported Simulation Brokering on the Semantic Web: Foundations for a Dynamic Composability Approach
Federated simulations address the need for interoperability, as well as the improvement of reuse and composability of existing simulation models. The focal goal in a federated sim...
Levent Yilmaz, Tuncer I. Ören
PAKM
2000
15 years 2 months ago
Knowledge Management and New Product Development: Learning from a Software Development Firm
The core of the new product development [NPD] process centers on knowledge creation, utilization and the management of knowledge. This manuscript uses a software firm case to esta...
Abraham B. Shani, James A. Sena
UAI
2000
15 years 2 months ago
Feature Selection and Dualities in Maximum Entropy Discrimination
Incorporating feature selection into a classi cation or regression method often carries a number of advantages. In this paper we formalize feature selection speci cally from a dis...
Tony Jebara, Tommi Jaakkola
CORR
2006
Springer
116views Education» more  CORR 2006»
15 years 1 months ago
Quantitative Measurements of the Influence of Participant Roles during Peer Review Meetings
Peer review meetings (PRMs) are formal meetings during which peers systematically analyze artifacts to improve their quality and report on non-conformities. This paper presents an...
Patrick d'Astous, Pierre N. Robillard, Franç...