4843 search results - page 782 / 969 » The Shortcut Problem - Complexity and Approximation |
128
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...
134
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
123
Voted
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
117
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
146
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...