Sciweavers

7075 search results - page 1317 / 1415
» Models and heterogeneous reasoning
Sort
View
FLAIRS
2009
14 years 7 months ago
Beating the Defense: Using Plan Recognition to Inform Learning Agents
In this paper, we investigate the hypothesis that plan recognition can significantly improve the performance of a casebased reinforcement learner in an adversarial action selectio...
Matthew Molineaux, David W. Aha, Gita Sukthankar
ICIP
2009
IEEE
14 years 7 months ago
Blind deblurring of foreground-background images
This paper presents a method for deblurring an image consisting of two layers (a foreground layer and a background layer) which have suffered different, unknown blurs. This is a s...
Mariana S. C. Almeida, Luis B. Almeida
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
14 years 7 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev
DASFAA
2011
IEEE
341views Database» more  DASFAA 2011»
14 years 7 months ago
Utility-Oriented K-Anonymization on Social Networks
\Identity disclosure" problem on publishing social network data has gained intensive focus from academia. Existing k-anonymization algorithms on social network may result in n...
Yazhe WANG, Long XIE, Baihua ZHENG, and Ken C. K. ...
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
14 years 7 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
« Prev « First page 1317 / 1415 Last » Next »