Sciweavers

4536 search results - page 782 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
HIPC
2007
Springer
15 years 10 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 10 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
ECAI
2004
Springer
15 years 10 months ago
Yet More Efficient EM Learning for Parameterized Logic Programs by Inter-Goal Sharing
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
Yoshitaka Kameya, Taisuke Sato, Neng-Fa Zhou
EKAW
2006
Springer
15 years 10 months ago
Matching Unstructured Vocabularies Using a Background Ontology
Existing ontology matching algorithms use a combination of lexical and structural correspondance between source and target ontologies. We present a realistic case-study where both ...
Zharko Aleksovski, Michel C. A. Klein, Warner ten ...
ENC
2006
IEEE
15 years 10 months ago
Adaptive Node Refinement Collocation Method for Partial Differential Equations
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...
José Antonio Muñoz-Gómez, Ped...