INFORMS Journal on Computing -- Table of Contents (Summer 2006 , 18 [3])

TABLE OF CONTENTS

QUICK SEARCH:

	Author:		Keyword(s):
Year:		Vol:		Page:

Receive this page by email each issue: [Sign up for eTOCs]

Contents: Summer 2006, Volume 18, Issue 3 [Index by Author] Other Issues:

Find articles in this issue containing these words:
[Search ALL Issues]

Table of Contents (PDF) | Front Matter (PDF)

To see an article, click its [Full Text] or [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.

Elaine Chew: From the Guest Editor—Special Cluster on Computation in Music
INFORMS JOURNAL ON COMPUTING 2006 18: 283-284. [PDF]

Darrell Conklin and Christina Anagnostopoulou: Segmental Pattern Discovery in Music
INFORMS JOURNAL ON COMPUTING 2006 18: 285-293. [Abstract] [PDF] [References]

Emilia Gómez: Tonal Description of Polyphonic Audio for Music Content Processing
INFORMS JOURNAL ON COMPUTING 2006 18: 294-304. [Abstract] [PDF] [References]

Elaine Chew: Slicing It All Ways: Mathematical Models for Tonal Induction, Approximation, and Segmentation Using the Spiral Array
INFORMS JOURNAL ON COMPUTING 2006 18: 305-320. [Abstract] [PDF] [References]

Judy A. Franklin: Recurrent Neural Networks for Music Computation
INFORMS JOURNAL ON COMPUTING 2006 18: 321-338. [Abstract] [PDF] [References]

Alexandra L. Uitdenbogerd, Abhijit Chattaraj, and Justin Zobel: Methodologies for Evaluation of Note-Based Music-Retrieval Systems
INFORMS JOURNAL ON COMPUTING 2006 18: 339-347. [Abstract] [PDF] [References]

Ioannis Gamvros, Bruce Golden, and S. Raghavan: The Multilevel Capacitated Minimum Spanning Tree Problem
INFORMS JOURNAL ON COMPUTING 2006 18: 348-365. [Abstract] [PDF] [References]

Joakim Kalvenes, Jeffery Kennington, and Eli Olinick: Base Station Location and Service Assignments in W–CDMA Networks
INFORMS JOURNAL ON COMPUTING 2006 18: 366-376. [Abstract] [PDF] [References]

Guidong Zhu, Jonathan F. Bard, and Gang Yu: A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem
INFORMS JOURNAL ON COMPUTING 2006 18: 377-390. [Abstract] [PDF] [References]

Stefan Irnich and Daniel Villeneuve: The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k $≥$ 3
INFORMS JOURNAL ON COMPUTING 2006 18: 391-406. [Abstract] [PDF] [References]