Sciweavers

3333 search results - page 397 / 667
» Optimal Power-Down Strategies
Sort
View
FOCS
2006
IEEE
16 years 1 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
CP
2005
Springer
16 years 24 days ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
SEMWEB
2005
Springer
16 years 23 days ago
Bootstrapping Ontology Alignment Methods with APFEL
Abstract. Ontology alignment is a prerequisite in order to allow for interoperation between different ontologies and many alignment strategies have been proposed to facilitate the ...
Marc Ehrig, Steffen Staab, York Sure
ICALP
2003
Springer
16 years 14 days ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
CEC
2009
IEEE
15 years 12 months ago
A cooperative coevolutionary algorithm with Correlation based Adaptive Variable Partitioning
—A cooperative coevolutionary algorithm (CCEA) is an extension to an evolutionary algorithm (EA); it employs a divide and conquer strategy to solve an optimization problem. In it...
Tapabrata Ray, Xin Yao