Sciweavers

219 search results - page 29 / 44
» Combinatorial Complexity of Regular Languages
Sort
View
107
Voted
EACL
2006
ACL Anthology
15 years 1 months ago
Multilingual Term Extraction from Domain-specific Corpora Using Morphological Structure
Morphologically complex terms composed from Greek or Latin elements are frequent in scientific and technical texts. Word forming units are thus relevant cues for the identificatio...
Delphine Bernhard
BIRTHDAY
2003
Springer
15 years 5 months ago
Using Alternating Words to Describe Symbolic Pictures
In this paper we present the concepts of drawn symbolic picture and symbolic picture. Such notions have been conceived as an extension of the concept of drawn pictures which was i...
Gennaro Costagliola, Vincenzo Deufemia, Filomena F...
98
Voted
HEURISTICS
2010
14 years 7 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
PPOPP
2005
ACM
15 years 6 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 14 days ago
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
Frédérique Bassino, Mathilde Bouvel,...