In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
For many medical procedures 3D bone models are built from Computed Tomography (CT) or Magnetic Resonance Imaging (MRI) data, both of which are expensive and time consuming, and un...
Chris Baker, Christian Debrunner, William Hoff, Ja...
With increasing reliability concerns for current and next generation VLSI technologies, fault-tolerance is fast becoming an integral part of system-on-chip and multicore architect...
— Mineral fertilizers application is an agricultural task widely performed by centrifugal spreaders. These machines give satisfying results with regularly spaced parallel tractor...
Teddy Virin, Jonas Koko, Emmanuel Piron, Philippe ...