Sciweavers

5622 search results - page 312 / 1125
» Solving architectural modelling problems using knowledge
Sort
View
AAAI
1994
15 years 8 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
NLP
2000
15 years 10 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
ICCV
2005
IEEE
16 years 8 months ago
A Symmetric Patch-Based Correspondence Model for Occlusion Handling
Occlusion is one of the challenging problems in stereo. In this paper, we solve the problem in a segment-based style. Both images are segmented, and we propose a novel patchbased ...
Yi Deng, Qiong Yang, Xueyin Lin, Xiaoou Tang
ICPP
2003
IEEE
15 years 12 months ago
Towards Grid Based Intelligent Information Systems
Multi agent systems, Grid technology, Semantic Web, and Web Intelligence paradigm are three modern approaches in information technologies, which we put together in our research eff...
A. Min Tjoa, Peter Brezany, Ivan Janciak
COR
2007
134views more  COR 2007»
15 years 6 months ago
Portfolio selection using neural networks
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
Alberto Fernández, Sergio Gómez