Sciweavers

1033 search results - page 189 / 207
» The Relative History Heuristic
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 6 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
MHCI
2009
Springer
15 years 6 months ago
Using an ecological framework to design mobile technologies for pediatric asthma management
Mobile technologies, due to their ubiquitous nature, play an important role in supporting health care. However, it is not easy to design useful integrated mobile services without ...
Hee Young Jeong, Rosa I. Arriaga
ISQED
2007
IEEE
141views Hardware» more  ISQED 2007»
15 years 6 months ago
OPC-Friendly Bus Driven Floorplanning
In this paper, we address the interconnect-driven floorplanning problem that integrates OPC-friendly bus assignment with floorplanning. Buses consist of a number of horizontal/v...
Hua Xiang, Liang Deng, Li-Da Huang, Martin D. F. W...
CP
2007
Springer
15 years 6 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 6 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano