Sciweavers

11717 search results - page 2281 / 2344
» Where are you From
Sort
View
CONCURRENCY
2000
133views more  CONCURRENCY 2000»
13 years 9 months ago
OpenMP versus threading in C/C++
When comparing OpenMP to other parallel programming models, it is easier to choose between OpenMP and MPI than between OpenMP and POSIX Threads (Pthreads). With languages like C a...
Bob Kuhn, Paul Petersen, Eamonn O'Toole
COR
2000
129views more  COR 2000»
13 years 9 months ago
Heuristics for the multi-vehicle covering tour problem
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
Mondher Hachicha, M. John Hodgson, Gilbert Laporte...
CORR
2000
Springer
116views Education» more  CORR 2000»
13 years 9 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
JACM
2000
86views more  JACM 2000»
13 years 9 months ago
Periodification scheme: constructing sorting networks with constant period
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oes...
JAIR
2000
96views more  JAIR 2000»
13 years 9 months ago
OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
Rune M. Jensen, Manuela M. Veloso
« Prev « First page 2281 / 2344 Last » Next »