Sciweavers

654 search results - page 23 / 131
» Ordered Sets and Complete Lattices
Sort
View
IJCGA
2006
79views more  IJCGA 2006»
13 years 7 months ago
Well-constrained Completion and Decomposition for under-constrained Geometric Constraint Problems
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
Gui-Fang Zhang, Xiao-Shan Gao
AI
2008
Springer
13 years 7 months ago
On the notion of concept I
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
Michael Freund
COLING
1992
13 years 8 months ago
The Proper Treatment Of Word Order In HPSG
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
Karel Oliva
CEC
2008
IEEE
14 years 2 months ago
A multi-agent based evolutionary algorithm in non-stationary environments
— In this paper, a multi-agent based evolutionary algorithm (MAEA) is introduced to solve dynamic optimization problems. The agents simulate living organism features and co-evolv...
Yang Yan, Hongfeng Wang, Dingwei Wang, Shengxiang ...
ILP
2003
Springer
14 years 24 days ago
Complexity Parameters for First-Order Classes
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
Marta Arias, Roni Khardon