501 search results - page 52 / 101 » Scheduling Abstractions for Local Search |
WWW
2008
ACM
16 years 1 months ago
2008
ACM
Information Retrieval on the WWW is important because it is hard to find what one is looking for. There is a plethora of information available, and searching relevant information ...
131
click to vote
ICDCS
2010
IEEE
15 years 5 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
126
click to vote
CP
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
EVOW
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
151
click to vote
EVOW
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. We consider the two-echelon location-routing problem (2ELRP), a well-known problem in freight distribution arising when establishing a two-level transport system with lim...