Sciweavers

2899 search results - page 140 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
ICTAI
2005
IEEE
15 years 11 months ago
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Jiqing T...
GECCO
2006
Springer
121views Optimization» more  GECCO 2006»
15 years 9 months ago
A splicing/decomposable encoding and its novel operators for genetic algorithms
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
Yong Liang, Kwong-Sak Leung, Kin-Hong Lee
JCM
2006
144views more  JCM 2006»
15 years 6 months ago
Using Micro-Genetic Algorithms to Improve Localization in Wireless Sensor Networks
Wireless sensor networks are widely adopted in many location-sensitive applications including disaster management, environmental monitoring, military applications where the precise...
Vincent Tam, King-Yip Cheng, King-Shan Lui
ICCD
2004
IEEE
100views Hardware» more  ICCD 2004»
16 years 2 months ago
Layout Driven Optimization of Datapath Circuits using Arithmetic Reasoning
This paper proposes a new formalism for layout-driven optimization of datapaths. It is based on preserving an arithmetic bit level representation of the arithmetic circuit portion...
Ingmar Neumann, Dominik Stoffel, Kolja Sulimma, Mi...
LSSC
2005
Springer
15 years 11 months ago
Ant Algorithm for Grid Scheduling Problem
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
Stefka Fidanova, Mariya K. Durchova