Journal: INFORMS Journal On Computing

Found 560 papers in total
The multilevel capacitated minimum spanning tree problem
The multilevel capacitated minimum spanning tree problem
2006,
In this paper, we consider the multilevel capacitated minimum spanning tree (MLCMST)...
Recurrent neural networks for music computation
Recurrent neural networks for music computation
2006,
Some researchers in the computational sciences have considered music computation,...
Modeling and performance analysis of a finite-buffer queue with batch arrivals, batch services, and setup times: The MX/GY/1/K + B queue with setup times
Modeling and performance analysis of a finite-buffer queue with batch arrivals, batch services, and setup times: The MX/GY/1/K + B queue with setup times
2006,
In this paper, we consider a finite-buffer M X /G Y /1/K + B queue with setup...
A projection-based reduction approach to computing sensitivity of steady-state response of nonlinear circuits
A projection-based reduction approach to computing sensitivity of steady-state response of nonlinear circuits
2006,
This paper presents a new algorithm for computing the sensitivity of steady-state...
Base station location and service assignments in W–CDMA networks
Base station location and service assignments in W–CDMA networks
2006,
Designing a wideband code division multiple access (W–CDMA) network is a...
Optimal synchronization policies for data warehouses
Optimal synchronization policies for data warehouses
2006,
The notion of a data warehouse for integrating operational data into a single...
A data-mining-based prefetching approach to caching for network storage systems
A data-mining-based prefetching approach to caching for network storage systems
2006,
The need for network storage has been increasing rapidly owing to the widespread use...
Methodologies for evaluation of note-based music-retrieval systems
Methodologies for evaluation of note-based music-retrieval systems
2006,
There have been many proposed music-retrieval systems, based on a variety of...
Integer linear programming models for global routing
Integer linear programming models for global routing
2006,
Modern integrated circuit design involves the layout of circuits consisting of...
A discrete adjoint variable method for printed-circuit board computer-aided design
A discrete adjoint variable method for printed-circuit board computer-aided design
2006,
We propose an adjoint-variable method for design sensitivity analysis of printed...
Segmental pattern discovery in music
Segmental pattern discovery in music
2006,
In this paper we describe a new method for discovering recurrent patterns in a corpus...
Tonal description of polyphonic audio for music content processing
Tonal description of polyphonic audio for music content processing
2006,
We present a method to extract a description of the tonal aspects of music from...
Slicing it all ways: Mathematical models for tonal induction, approximation, and segmentation using the spiral array
Slicing it all ways: Mathematical models for tonal induction, approximation, and segmentation using the spiral array
2006,
This paper presents the spiral array model and its associated algorithms for tonal...
Stockout compensation: Joint inventory and price optimization in electronic retailing
Stockout compensation: Joint inventory and price optimization in electronic retailing
2006,
Delays in product availability are common in e-commerce where electronic retailers try...
Task scheduling in a finite-resource, reconfigurable hardware/software codesign environment
Task scheduling in a finite-resource, reconfigurable hardware/software codesign environment
2006,
This paper describes how static task-scheduling methods using stochastic search...
Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
2006,
We consider both branch-and-cut and column-generation approaches for the problem of...
A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem
A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem
2006,
This paper considers the multimode resource-constrained project-scheduling problem...
The shortest-path problem with resource constraints and k-cycle elimination for k ≥ 3
The shortest-path problem with resource constraints and k-cycle elimination for k ≥ 3
2006,
The elementary shortest-path problem with resource constraints (ESPPRC) is a widely...
A new pricing model for competitive telecommunications services using congestion discounts
A new pricing model for competitive telecommunications services using congestion discounts
2005,
We propose a two-stage pricing approach that enables providers of telecommunications...
Laying out sparse graphs with provably minimum bandwidth
Laying out sparse graphs with provably minimum bandwidth
2005,
Finding a linear layout of a graph having minimum bandwidth is a combinatorial...
Planar branch decompositions I: The ratcatcher
Planar branch decompositions I: The ratcatcher
2005,
The notion of branch decompositions and its related connectivity invariant for graphs,...
Planar branch decompositions II: The cycle method
Planar branch decompositions II: The cycle method
2005,
This is the second of two papers dealing with the relationship of branchwidth and...
Guided local search for the three-dimensional bin-packing problem
Guided local search for the three-dimensional bin-packing problem
2003,
The three-dimensional bin-packing problem is the problem of orthogonally packing a set...
A general purpose algorithm for three-dimensional packing
A general purpose algorithm for three-dimensional packing
2005,
We present a fast and efficient heuristic algorithm for solving a large class of...
Papers per page: