Sciweavers

881 search results - page 129 / 177
» Solving satisfiability problems with preferences
Sort
View
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
14 years 1 months ago
A genetic algorithm encoding for a class of cardinality constraints
A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variabl...
Helio J. C. Barbosa, Afonso C. C. Lemonge
IPSN
2005
Springer
14 years 1 months ago
QoM and lifetime-constrained random deployment of sensor networks for minimum energy consumption
— We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at e...
Morteza Maleki, Massoud Pedram
CGI
2003
IEEE
14 years 28 days ago
Visualization of Distributed Processes Using "Data Jewelry Box" Algorithm
Visualization of distributed processes is useful for the management of large-scale distributed computing systems. Reactivity and scalability are especially important requirements ...
Yumi Yamaguchi, Takayuki Itoh
EVOW
2001
Springer
14 years 4 days ago
Autonomous Photogrammetric Network Design Using Genetic Algorithms
Abstract. This work describes the use of genetic algorithms for automating the photogrammetric network design process. When planning a photogrammetric network, the cameras should b...
Gustavo Olague
CP
1999
Springer
13 years 12 months ago
The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization
In this paper we present a Lagrange-multiplier formulation of discrete constrained optimization problems, the associated discrete-space first-order necessary and sufficient condit...
Benjamin W. Wah, Zhe Wu