8109 search results - page 362 / 1622 » A Model of Component-Based Programming |
191
click to vote
EMO
2006
Springer
15 years 8 months ago
2006
Springer
Multi-objective metaheuristics have previously been applied to partial classification, where the objective is to produce simple, easy to understand rules that describe subsets of a...
136
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
One crucial issue in genetic programming (GP) is how to acquire promising building blocks efficiently. In this paper, we propose a GP method (called GPTM, GP with Tree Mining) whi...
180
click to vote
AIEDAM
2008
15 years 6 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
158
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
177
click to vote
JUCS
2007
15 years 6 months ago
2007
: Most automated reasoning tasks with practical applications can be automatically reformulated into a constraint solving task. A constraint programming platform can thus act as a u...