Sciweavers

2150 search results - page 250 / 430
» On a restricted cross-intersection problem
Sort
View
141
Voted
IJFCS
2002
58views more  IJFCS 2002»
15 years 3 months ago
Vector Algorithms for Approximate String Matching
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
Anne Bergeron, Sylvie Hamel
162
Voted
CORR
1998
Springer
126views Education» more  CORR 1998»
15 years 3 months ago
Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
Victor W. Marek, Miroslaw Truszczynski
117
Voted
JAIR
1998
81views more  JAIR 1998»
15 years 3 months ago
Computational Aspects of Reordering Plans
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
Christer Bäckström
JISE
2002
165views more  JISE 2002»
15 years 3 months ago
Locality-Preserving Dynamic Load Balancing for Data-Parallel Applications on Distributed-Memory Multiprocessors
Load balancing and data locality are the two most important factors in the performance of parallel programs on distributed-memory multiprocessors. A good balancing scheme should e...
Pangfeng Liu, Jan-Jan Wu, Chih-Hsuae Yang
110
Voted
SCHOLARPEDIA
2008
110views more  SCHOLARPEDIA 2008»
15 years 3 months ago
Luce's choice axiom
A geometric approach is introduced to explain phenomena that can arise with Luce's choice axiom; e.g., differences occur when determining the likelihood of a ranking by start...
Duncan Luce