Sciweavers

110 search results - page 19 / 22
» Simple Search Methods for Finding a Nash Equilibrium
Sort
View
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
13 years 7 months ago
Learning and planning high-dimensional physical trajectories via structured Lagrangians
— We consider the problem of finding sufficiently simple models of high-dimensional physical systems that are consistent with observed trajectories, and using these models to s...
Paul Vernaza, Daniel D. Lee, Seung-Joon Yi
ICCV
2007
IEEE
14 years 10 months ago
Articulated Shape Matching by Robust Alignment of Embedded Representations
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...
Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond ...
ECAI
2004
Springer
14 years 8 days ago
Encoding Quantified CSPs as Quantified Boolean Formulae
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
PRL
2007
180views more  PRL 2007»
13 years 8 months ago
Feature selection based on rough sets and particle swarm optimization
: We propose a new feature selection strategy based on rough sets and Particle Swarm Optimization (PSO). Rough sets has been used as a feature selection method with much success, b...
Xiangyang Wang, Jie Yang, Xiaolong Teng, Weijun Xi...
JCB
2006
140views more  JCB 2006»
13 years 8 months ago
HAPLOFREQ-Estimating Haplotype Frequencies Efficiently
A commonly used tool in disease association studies is the search for discrepancies between the haplotype distribution in the case and control populations. In order to find this d...
Eran Halperin, Elad Hazan