Sciweavers

116 search results - page 9 / 24
» Reasoning Symbolically About Partially Matched Cases
Sort
View
IJCV
2010
131views more  IJCV 2010»
14 years 8 months ago
Using the Particle Filter Approach to Building Partial Correspondences Between Shapes
Abstract Constructing correspondencesbetween points characterizing one shape with those characterizing another is crucial to understanding what the two shapes have in common. These...
Rolf Lakämper, Marc Sobel
99
Voted
ICCV
2011
IEEE
13 years 9 months ago
The Power of Comparative Reasoning
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
Jay Yagnik, Dennis Strelow, David Ross, Ruei-sung ...
ATAL
2008
Springer
14 years 11 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...
VMCAI
2009
Springer
15 years 4 months ago
Mixed Transition Systems Revisited
—A variety of partial modeling formalisms, aimed re and reason about abstractions, have been proposed. Some, e.g., Kripke Modal Transition Systems (KMTSs) put strong restrictions...
Ou Wei, Arie Gurfinkel, Marsha Chechik
73
Voted
ENTCS
2007
108views more  ENTCS 2007»
14 years 9 months ago
Termination Criteria for DPO Transformations with Injective Matches
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
Tihamer Levendovszky, Ulrike Prange, Hartmut Ehrig