Sciweavers

25 search results - page 4 / 5
» Algorithms for Three Versions of the Shortest Common Superst...
Sort
View
CP
2000
Springer
13 years 11 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
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...
Benjamin W. Wah, Yixin Chen
ICML
1998
IEEE
14 years 8 months ago
A Randomized ANOVA Procedure for Comparing Performance Curves
Three factors are related in analyses of performance curves such as learning curves: the amount of training, the learning algorithm, and performance. Often we want to know whether...
Justus H. Piater, Paul R. Cohen, Xiaoqin Zhang, Mi...
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
14 years 25 days ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
PODC
2010
ACM
13 years 11 months ago
Constant RMR solutions to reader writer synchronization
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
Vibhor Bhatt, Prasad Jayanti
TC
2011
13 years 2 months ago
Improved Division by Invariant Integers
—This paper considers the problem of dividing a two-word integer by a single-word integer, together with a few extensions and applications. Due to lack of efficient division ins...
Niels Moller, Torbjörn Granlund