Sciweavers

10156 search results - page 140 / 2032
» Step by Step to Histories
Sort
View
STRINGOLOGY
2004
15 years 8 months ago
Sorting suffixes of two-pattern strings
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial di...
Frantisek Franek, William F. Smyth
AMAI
2006
Springer
15 years 7 months ago
A split-combination approach to merging knowledge bases in possibilistic logic
In this paper, we propose an adaptive approach to merging possibilistic knowledge bases that deploys multiple operators instead of a single operator in the merging process. The me...
Guilin Qi, Weiru Liu, David H. Glass, David A. Bel...
ORL
2000
77views more  ORL 2000»
15 years 6 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
SIAMSC
2010
144views more  SIAMSC 2010»
15 years 5 months ago
A Fully Implicit Domain Decomposition Algorithm for Shallow Water Equations on the Cubed-Sphere
Abstract. Popular approaches for solving the shallow water equations (SWE) for climate modeling are explicit and semi-implicit methods, both have certain constraints on the time st...
Chao Yang, Jianwen Cao, Xiao-Chuan Cai
WDAG
2010
Springer
168views Algorithms» more  WDAG 2010»
15 years 5 months ago
Fast Randomized Test-and-Set and Renaming
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...
Dan Alistarh, Hagit Attiya, Seth Gilbert, Andrei G...