Sciweavers

1295 search results - page 71 / 259
» Palimpsests of Time and Place
Sort
View
EOR
2007
174views more  EOR 2007»
14 years 12 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
TSMC
2008
84views more  TSMC 2008»
14 years 11 months ago
Learning Inverse Kinematics: Reduced Sampling Through Decomposition Into Virtual Robots
We propose a technique to speedup the learning of the inverse kinematics of a robot manipulator by decomposing it into two or more virtual robot arms. Unlike previous decomposition...
Vicente Ruiz de Angulo, Carme Torras
CORR
2004
Springer
111views Education» more  CORR 2004»
14 years 11 months ago
Finding Approximate Palindromes in Strings Quickly and Simply
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
L. Allison
SAC
2011
ACM
14 years 2 months ago
Fault tolerance evaluation and schedulability analysis
The use of real-time systems can differ from their initial design and requirements. New missions may take place in a more agressive environment and cause faults that are not manag...
Florian Many, David Doose
WWW
2010
ACM
15 years 6 months ago
Context-aware citation recommendation
When you write papers, how many times do you want to make some citations at a place but you are not sure which papers to cite? Do you wish to have a recommendation system which ca...
Qi He, Jian Pei, Daniel Kifer, Prasenjit Mitra, C....