206 search results - page 37 / 42 » Constant factor approximation algorithm for the knapsack med... |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
IJCAI
2007
13 years 9 months ago
2007
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
ICALP
2004
Springer
14 years 26 days 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...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...