Sciweavers

463 search results - page 76 / 93
» Localizing Search in Reinforcement Learning
Sort
View
EAAI
2007
154views more  EAAI 2007»
15 years 5 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
SMI
2006
IEEE
123views Image Analysis» more  SMI 2006»
15 years 12 months ago
Selecting Distinctive 3D Shape Descriptors for Similarity Retrieval
Databases of 3D shapes have become widespread for a variety of applications, and a key research problem is searching these databases for similar shapes. This paper introduces a me...
Philip Shilane, Thomas A. Funkhouser
AIPS
2008
15 years 8 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
ECML
2005
Springer
15 years 11 months ago
Mode Directed Path Finding
Abstract. Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbi...
Irene M. Ong, Inês de Castro Dutra, David Pa...
ICFP
2008
ACM
16 years 5 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...