8671 search results - page 324 / 1735 » A generator for hierarchical problems |
170
click to vote
GECCO
2007
Springer
16 years 27 days ago
2007
Springer
In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experime...
173
click to vote
IUI
2005
ACM
16 years 9 days ago
2005
ACM
Pinpoint is a promising first step towards using a rich model of task context in proactive and dynamic IR systems. Pinpoint allows a user to navigate decision tree representations...
191
click to vote
GECCO
2005
Springer
16 years 6 days ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
180
click to vote
SETA
2004
Springer
16 years 2 days ago
2004
Springer
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
227
click to vote
WEA
2010
Springer
15 years 12 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...