Sciweavers

794 search results - page 44 / 159
» Improved algorithms for orienteering and related problems
Sort
View
ACL
2009
13 years 8 months ago
Answering Opinion Questions with Random Walks on Graphs
Opinion Question Answering (Opinion QA), which aims to find the authors' sentimental opinions on a specific target, is more challenging than traditional factbased question an...
Fangtao Li, Yang Tang, Minlie Huang, Xiaoyan Zhu
FLAIRS
2003
13 years 11 months ago
A Graph Based Synthesis Algorithm for Solving CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
Wanlin Pang, Scott D. Goodwin
CAIP
2003
Springer
202views Image Analysis» more  CAIP 2003»
14 years 3 months ago
Modeling Adaptive Deformations during Free-Form Pose Estimation
In this article we discuss the 2D-3D pose estimation problem of deformable 3D free-form contours. In our scenario we observe objects of any 3D shape in an image of a calibrated cam...
Bodo Rosenhahn, Christian Perwass, Gerald Sommer
CEC
2005
IEEE
14 years 3 months ago
Elitist generational genetic chromodynamics - a new radii-based evolutionary algorithm for multimodal optimization
A new radii-based evolutionary algorithm (EA) designed for multimodal optimization problems is proposed. The approach can be placed within the genetic chromodynamics framework and ...
Catalin Stoean, Mike Preuss, Ruxandra Gorunescu, D...
AAAI
1994
13 years 11 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex