Sciweavers

3433 search results - page 376 / 687
» Heuristics for a bidding problem
Sort
View
ISCC
2008
IEEE
130views Communications» more  ISCC 2008»
16 years 1 months ago
A graph theory based scheduling algorithm For MIMO-CDMA systems using zero forcing beamforming
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
Elmahdi Driouch, Wessam Ajib
PERCOM
2008
ACM
16 years 1 months ago
TIGRA: Timely Sensor Data Collection Using Distributed Graph Coloring
In this paper we present a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the probl...
Lilia Paradis, Qi Han
CEC
2007
IEEE
16 years 1 months ago
Multi-objective strip packing using an evolutionary algorithm
— Good algorithms exist for solving the strip packing problem when the objective is to minimise the amount of wasted material. We describe a multi-objective evolutionary algorith...
Simon Illich, R. Lyndon While, Luigi Barone
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
16 years 1 months ago
A hybrid evolutionary programming algorithm for spread spectrum radar polyphase codes design
This paper presents a hybrid evolutionary programming algorithm to solve the spread spectrum radar polyphase code design problem. The proposed algorithm uses an Evolutionary Progr...
Ángel M. Pérez-Bellido, Sancho Salce...
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
16 years 28 days ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier