Sciweavers

2109 search results - page 268 / 422
» Solving Necklace Constraint Problems
Sort
View
INFOCOM
2007
IEEE
15 years 11 months ago
Exploiting Hidden Convexity For Flexible And Robust Resource Allocation In Cellular Networks
— A systematic approach to solve seemingly nonconvex resource allocation problems in wireless cellular networks is studied in this paper. By revealing and exploiting the hidden c...
Chee-Wei Tan, Daniel Pérez Palomar, Mung Ch...
ICTAI
1999
IEEE
15 years 9 months ago
Search Strategies for Hybrid Search Spaces
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
Carla P. Gomes, Bart Selman
DOCENG
2009
ACM
15 years 9 months ago
Review of automatic document formatting
We review the literature on automatic document formatting with an emphasis on recent work in the field. One common way to frame document formatting is as a constrained optimizatio...
Nathan Hurst, Wilmot Li, Kim Marriott
AAAI
2010
15 years 6 months ago
Multi-Instance Dimensionality Reduction
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
Yu-Yin Sun, Michael K. Ng, Zhi-Hua Zhou
GECCO
2008
Springer
126views Optimization» more  GECCO 2008»
15 years 6 months ago
Swarm intelligence in e-learning: a learning object sequencing agent based on competencies
In e-learning initiatives content creators are usually required to arrange a set of learning resources in order to present them in a comprehensive way to the learner. Course mater...
Luis de Marcos, José-Javier Martínez...