Sciweavers

2027 search results - page 43 / 406
» When is it best to best-respond
Sort
View
EUROPAR
2010
Springer
13 years 10 months ago
Analysis of Multi-Organization Scheduling Algorithms
Abstract. In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Probl...
Johanne Cohen, Daniel Cordeiro, Denis Trystram, Fr...
CAGD
2008
158views more  CAGD 2008»
13 years 10 months ago
On the deviation of a parametric cubic spline interpolant from its data polygon
When fitting a parametric curve through a sequence of points, it is important in applications that the curve should not exhibit unwanted oscillations. In this paper we take the vi...
Michael S. Floater
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 10 months ago
A Note on the Number of Hamiltonian Paths in Strong Tournaments
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
Arthur H. Busch
CG
2007
Springer
13 years 10 months ago
Teaching OpenGL shaders: Hands-on, interactive, and immediate feedback
This paper describes the teaching of OpenGL shaders with hands-on a program called glman. Hands-on education is at its best when the students’ experimental feedback loop is very...
Mike Bailey
TCOM
2008
108views more  TCOM 2008»
13 years 10 months ago
Two-relay distributed switch and stay combining
We study a distributed version of switch-and-stay combining (DSSC) for systems that utilize two relays. In particular, four different scenarios are considered, depending on a) whet...
Diomidis S. Michalopoulos, George K. Karagiannidis