The minimum shift design problem
✍ Scribed by Luca Di Gaspero; Johannes Gärtner; Guy Kortsarz; Nysret Musliu; Andrea Schaerf; Wolfgang Slany
- Publisher
- Springer US
- Year
- 2007
- Tongue
- English
- Weight
- 578 KB
- Volume
- 155
- Category
- Article
- ISSN
- 0254-5330
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The "minimum vocabulary problem" for a dictionary has applications in indexing and other domains of information retrieval. A simple directed-graph model of a dictionary results in a linear-time algorithm for this problem. Since it is known that many minimum vocabularies can exist for a dictionary, a
The problem of minimizing the number of dummy tasks in a PERT network was shown to be NP-complete by Krishnamoorthy and Deo [9]. Previous methods of dealing with this problem have imposed extra restrictions on the solution [2,4] or have considered "good" exponential algorithms to solve the problem [
One approach to improving the generalization power of a neural net is to try to minimize the number of nonzero weights used. We examine two issues relevant to this approach, .for single-layer nets. First we bound the VC dimension of the set of linear-threshold fimctions that have nonzero weights fig