Sciweavers

982 search results - page 163 / 197
» Reduction Relations for Agent Models
Sort
View
AAI
2000
182views more  AAI 2000»
15 years 16 days ago
Implementing a Business Process Management System Using ADEPT: A Real-World Case Study
: This paper describes how ADEPT's agent-based design and implementation philosophy was used to prototype a business process management system for a real-world application. Th...
Nicholas R. Jennings, Peyman Faratin, Timothy J. N...
AAAI
1994
15 years 2 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
99
Voted
ATAL
2010
Springer
15 years 1 months ago
Frequency adjusted multi-agent Q-learning
Multi-agent learning is a crucial method to control or find solutions for systems, in which more than one entity needs to be adaptive. In today's interconnected world, such s...
Michael Kaisers, Karl Tuyls
129
Voted
CIKM
2006
Springer
15 years 4 months ago
Coupling feature selection and machine learning methods for navigational query identification
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...
Yumao Lu, Fuchun Peng, Xin Li, Nawaaz Ahmed
108
Voted
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 2 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou