Sciweavers

1160 search results - page 16 / 232
» Revisiting the Sequence Constraint
Sort
View
95
Voted
DAGSTUHL
2004
15 years 3 months ago
The communication complexity of the Exact-N Problem revisited
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
William I. Gasarch, James Glenn, Andrey Utis
EOR
2007
80views more  EOR 2007»
15 years 1 months ago
The tool switching problem revisited
In this note we study the tool switching problem with non-uniform tool sizes. More specifically, we consider the problem where the job sequence is given as part of the input. We ...
Yves Crama, Linda S. Moonen, Frits C. R. Spieksma,...
IJMMS
2011
104views more  IJMMS 2011»
14 years 8 months ago
Revisiting path steering for 3D manipulation tasks
The law of path steering, as proposed by Accot and Zhai, describes a quantitative relationship between human temporal performance and the path’s spatial characteristics. The ste...
Lei Liu, Jean-Bernard Martens, Robert van Liere
RECOMB
1997
Springer
15 years 6 months ago
Progressive multiple alignment with constraints
A progressive alignment algorithm produces a multi-alignment of a set of sequences by repeatedly aligning pairs of sequences and/or previously generated alignments. We describe a ...
Gene Myers, Sanford Selznick, Zheng Zhang 0004, We...
123
Voted
MOBICOM
2004
ACM
15 years 7 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu