297 search results - page 10 / 60 » Towards a Parallel Search for Solutions of Non-deterministic... |
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
ICDCS
2012
IEEE
11 years 10 months ago
2012
IEEE
—Cloud resources are usually priced in multiple markets with different service guarantees. For example, Amazon EC2 prices virtual instances under three pricing schemes — the su...
DCOSS
2011
Springer
12 years 8 months ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
ICPP
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, a novel packet classification scheme optimized for multi-core network processors is proposed. The algorithm, Explicit Cuttings (ExpCuts), adopts a hierarchical spac...
HPDC
2002
IEEE
14 years 1 months ago
2002
IEEE
Rather than painful, manual, static, per-connection optimization of TCP buffer sizes simply to achieve acceptable performance for distributed applications [8, 10], many researcher...