Sciweavers

1532 search results - page 82 / 307
» The Symbol Grounding Problem
Sort
View
HEURISTICS
2010
15 years 1 months ago
A metaheuristic approach to the urban transit routing problem
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
Lang Fan, Christine L. Mumford
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 7 months ago
A Unified Approach to Approximating Partial Covering Problems
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Jochen Könemann, Ojas Parekh, Danny Segev
143
Voted
FSTTCS
2005
Springer
15 years 9 months ago
The Set Cover with Pairs Problem
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
Refael Hassin, Danny Segev
AAAI
1998
15 years 5 months ago
TRIPS: An Integrated Intelligent Problem-Solving Assistant
We discuss what constitutes an integrated system in AI, and why AI researchers should be interested in building and studying them. Taking integrated systems to be ones that integr...
George Ferguson, James F. Allen
IROS
2009
IEEE
131views Robotics» more  IROS 2009»
15 years 10 months ago
Visual Place Categorization: Problem, dataset, and algorithm
Abstract— In this paper we describe the problem of Visual Place Categorization (VPC) for mobile robotics, which involves predicting the semantic category of a place from image me...
Jianxin Wu, Henrik I. Christensen, James M. Rehg