Sciweavers

1792 search results - page 233 / 359
» Improved scheduling in rings
Sort
View
ICSM
1999
IEEE
15 years 10 months ago
Test Case Prioritization: An Empirical Study
Test case prioritization techniques schedule test cases for execution in an order that attempts to maximize some objective function. A variety of objective functions are applicabl...
Gregg Rothermel, Roland H. Untch, Chengyun Chu, Ma...
SIGCOMM
1996
ACM
15 years 10 months ago
Speeding up Protocols for Small Messages
Many techniques have been discovered to improve performance of bulk data transfer protocols which use large messages. This paper describes a technique that improves protocol perfo...
Trevor Blackwell
GPC
2007
Springer
15 years 8 months ago
Towards a Peer-To-Peer Platform for High Performance Computing
This paper describes a Global Computing (GC) environment, called XtremWeb-CH (XWCH). XWCH is an improved version of a GC tool called XtremWeb (XW). XWCH tries to enrich XW in orde...
Nabil Abdennadher, Régis Boesch
AMC
2008
106views more  AMC 2008»
15 years 6 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
Miguel A. Salido
COR
2008
118views more  COR 2008»
15 years 6 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...