Journal: Information Processing Letters

Found 137 papers in total
Parikh's theorem: A simple and direct automaton construction
Parikh's theorem: A simple and direct automaton construction
2011,
Parikh's theorem states that the Parikh image of a context-free language is semilinear...
Improving adaptivity and fairness of processing real‐time tasks with QoS requirements on clusters through dynamic scheduling
Improving adaptivity and fairness of processing real‐time tasks with QoS requirements on clusters through dynamic scheduling
2011,
In this paper, we consider the problem of scheduling a set of independent real-time...
String matching with inversions and translocations in linear average time (most of the time)
String matching with inversions and translocations in linear average time (most of the time)
2011,
We present an efficient algorithm for finding all approximate occurrences of a given...
Speedup for a periodic subgraph miner
Speedup for a periodic subgraph miner
2011,
? We study the periodicity of subgraphs in a dynamic network. ? A dynamic...
An efficient location‐based compromise‐tolerant key management scheme for sensor networks
An efficient location‐based compromise‐tolerant key management scheme for sensor networks
2011,
We propose a novel location-based key management scheme for sensor networks. Our...
Flexible coloring
Flexible coloring
2011,
? We propose a new optimization problem called ‘flexible coloring’....
Approximation algorithms for the Fault‐Tolerant Facility Placement problem
Approximation algorithms for the Fault‐Tolerant Facility Placement problem
2011,
? We studied a generalized version of Facility Location (FL) problem. ? We...
Minimum cost flows with minimum quantities
Minimum cost flows with minimum quantities
2011,
? Proof of strong NP‐completeness of Min Cost Network Flow with Minimum...
How much can lookahead help in online single machine scheduling?
How much can lookahead help in online single machine scheduling?
2008,
This paper studies online single machine scheduling where jobs have unit length and...
Dispersed particle swarm optimization
Dispersed particle swarm optimization
2008,
In particle swarm optimization (PSO) literatures, the published social coefficient...
A note on the k-Canadian Traveller Problem
A note on the k-Canadian Traveller Problem
2008,
We consider the online problem k -CTP, which is the problem to guide a vehicle from...
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
2008,
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization...
A note of an O(n3/logn) time algorithm for all pairs shortest paths
A note of an O(n3/logn) time algorithm for all pairs shortest paths
2008,
We improve the all pairs shortest path algorithm given by Takaoka to time complexity...
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Adding cardinality constraints to integer programs with applications to maximum satisfiability
2008,
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k...
The complexity of linear programming in (γ,κ) form
The complexity of linear programming in (γ,κ) form
2008,
Linear programming in (γ,κ)-form is a restricted class of linear...
A note on optimal floodlight illumination of stages
A note on optimal floodlight illumination of stages
2008,
We consider the problem of illuminating a straight line segment with floodlights. The...
Primal–dual approximation algorithms for the prize-collecting Steiner tree problem
Primal–dual approximation algorithms for the prize-collecting Steiner tree problem
2007,
The primal–dual scheme has been used to provide approximation algorithms for...
Particle swarm optimization-based algorithms for the traveling salesman problem and the generalized TSP
Particle swarm optimization-based algorithms for the traveling salesman problem and the generalized TSP
2007,
A novel particle swarm optimization (PSO)-based algorithm for the traveling salesman...
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
2007,
We consider the scheduling of orders in an environment with m uniform machines in...
The finite horizon investor problem with a budget constraint
The finite horizon investor problem with a budget constraint
2007,
We study a model that incorporates a budget constraint in a decision making problem....
The cycle roommates problem: a hard case of kidney exchange
The cycle roommates problem: a hard case of kidney exchange
2007,
Recently, a number of interesting algorithmic problems have arisen from the emergence,...
Algorithms for the on-line quota traveling salesman problem
Algorithms for the on-line quota traveling salesman problem
2004,
The Quota Traveling Salesman Problem is a generalization of the well-known Traveling...
A fully polynomial-time approximation scheme (FPTAS) for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
A fully polynomial-time approximation scheme (FPTAS) for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
2007,
We study the problems of scheduling a set of nonpreemptive jobs on a single machine...
Dynamic programming algorithms for the mosaic longest common subsequence problem
Dynamic programming algorithms for the mosaic longest common subsequence problem
2007,
The longest common subsequence (LCS) problem can be used to measure the relationship...
Papers per page: