Sciweavers

511 search results - page 9 / 103
» Using Combinatorial Optimization Methods for Quantification ...
Sort
View
AI
2006
Springer
14 years 9 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
AAAI
2000
14 years 11 months ago
Solving Combinatorial Auctions Using Stochastic Local Search
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
Holger H. Hoos, Craig Boutilier
PDCN
2004
14 years 11 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
WIOPT
2010
IEEE
14 years 8 months ago
On the use of packet scheduling in self-optimization processes: Application to coverage-capacity optimization
—Self-organizing networks (SON) is commonly seen as a way to increase network performance while simplifying its management. This paper investigates Packet Scheduling (PS) in the ...
Richard Combes, Zwi Altman, Eitan Altman
MICCAI
2007
Springer
15 years 10 months ago
Combinatorial Optimization for Electrode Labeling of EEG Caps
Abstract. An important issue in electroencephalographiy (EEG) experiments is to measure accurately the three dimensional (3D) positions of the electrodes. We propose a system where...
Jean-Michel Badier, Mickaël Péchaud, R...