Sciweavers

9810 search results - page 194 / 1962
» Problems, Descriptions and Objects
Sort
View
ICMLA
2004
15 years 6 months ago
Satisficing Q-learning: efficient learning in problems with dichotomous attributes
In some environments, a learning agent must learn to balance competing objectives. For example, a Q-learner agent may need to learn which choices expose the agent to risk and whic...
Michael A. Goodrich, Morgan Quigley
ICCV
2003
IEEE
16 years 6 months ago
Using Specularities for Recognition
Recognition systems have generally treated specular highlights as noise. We show how to use these highlights as a positive source of information that improves recognition of shiny...
Margarita Osadchy, David W. Jacobs, Ravi Ramamoort...
SEMWEB
2001
Springer
15 years 9 months ago
Overcoming Ontology Mismatches in Transactions with Self-Describing Service Agents
One vision of the “Semantic Web” of the future is that software agents will interact with each other using formal metadata that reveal their interfaces. We examine one plausibl...
Drew V. McDermott, Mark H. Burstein, Douglas R. Sm...
COLING
2010
14 years 11 months ago
Shallow Information Extraction from Medical Forum Data
We study a novel shallow information extraction problem that involves extracting sentences of a given set of topic categories from medical forum data. Given a corpus of medical fo...
Parikshit Sondhi, Manish Gupta, ChengXiang Zhai, J...
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
16 years 2 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang