Sciweavers

995 search results - page 51 / 199
» Wire-speed total order
Sort
View
EOR
2007
92views more  EOR 2007»
13 years 8 months ago
Planning and approximation models for delivery route based services with price-sensitive demands
Classical vehicle routing problems typically do not consider the impact of delivery price on the demand for delivery services. Existing models seek the minimum sum of tour lengths...
Joseph Geunes, Zuo-Jun Max Shen, Akin Emir
LATIN
2010
Springer
14 years 3 months ago
Optimal Succinctness for Range Minimum Queries
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
Johannes Fischer
FCT
2009
Springer
14 years 3 months ago
On Random Betweenness Constraints
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially di...
Andreas Goerdt
ICPPW
2006
IEEE
14 years 2 months ago
A Runtime Scheduling Method for Dynamic and Heterogeneous Platforms
In this paper, we present a runtime method for scheduling parallel applications on dynamic and heterogeneous platforms. It can be used to schedule parallel applications whose tota...
Salah-Salim Boutammine, Daniel Millot, Christian P...
IOLTS
2006
IEEE
84views Hardware» more  IOLTS 2006»
14 years 2 months ago
Fault Tolerant System Design Method Based on Self-Checking Circuits
This paper describes a highly reliable digital circuit design method based on totally self checking blocks implemented in FPGAs. The bases of the self checking blocks are parity p...
Pavel Kubalík, Petr Fiser, Hana Kubatova