2244 search results - page 110 / 449 » A new heuristic approach for non-convex optimization problem... |
138
click to vote
COMCOM
2008
15 years 6 months ago
2008
The primary focus of this paper is the design of efficient algorithm for the calculation of solution to the placement of proxies for performance optimization in hierarchical relia...
147
click to vote
CP
2009
Springer
16 years 1 months ago
2009
Springer
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
164
click to vote
GECCO
2007
Springer
16 years 14 days ago
2007
Springer
I present MOSES (meta-optimizing semantic evolutionary search), a new probabilistic modeling (estimation of distribution) approach to program evolution. Distributions are not esti...
176
click to vote
DAWAK
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
161
click to vote
WADS
1995
Springer
15 years 9 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...