Sciweavers

16404 search results - page 534 / 3281
» A set coverage problem
Sort
View
COR
2010
105views more  COR 2010»
15 years 7 months ago
Effective formulation reductions for the quadratic assignment problem
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
Huizhen Zhang, Cesar Beltran-Royo, Miguel Constant...
CORR
2006
Springer
130views Education» more  CORR 2006»
15 years 7 months ago
On optimal quantization rules for some sequential decision problems
We consider the problem of sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the sample size), a...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...
ECCC
2006
99views more  ECCC 2006»
15 years 7 months ago
On the Subgroup Distance Problem
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
JUCS
2008
148views more  JUCS 2008»
15 years 6 months ago
SHARP Online: An Adaptive Hypermedia System Applied to Mathematical Problem Solving
: In this article we present the development of a web application called SHARP Online: An Adaptive Hypermedia System Applied to Mathematical Problem Solving. The pedagogical basis ...
Ana Belén Gil, Raquel Rodríguez, Fra...
KES
2008
Springer
15 years 6 months ago
Knowledge-based genetic algorithm for university course timetabling problems
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimiza...
Hitoshi Kanoh, Yuusuke Sakamoto