Sciweavers

11051 search results - page 64 / 2211
» An Investigation of Generalized Cases
Sort
View
PPAM
2001
Springer
14 years 2 months ago
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
Krzysztof Giaro, Marek Kubale, Michal Malafiejski,...
WADT
1998
Springer
14 years 2 months ago
Parallel Admissible Graph Rewriting
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in gene...
Rachid Echahed, Jean-Christophe Janodet
IJFCS
2007
54views more  IJFCS 2007»
13 years 10 months ago
Pure and O-Substitution
The basic properties of distributivity and deletion of pure and o-substitution are investigated. The obtained results are applied to show preservation of recognizability in a numb...
Andreas Maletti
CAGD
1999
198views more  CAGD 1999»
13 years 10 months ago
Discrete Coons patches
We investigate surfaces which interpolate given boundary curves. We show that the discrete bilinearly blended Coons patch can be defined as the solution of a linear system. With t...
Gerald E. Farin, Dianne Hansford
ICML
2002
IEEE
14 years 11 months ago
On generalization bounds, projection profile, and margin distribution
We study generalization properties of linear learning algorithms and develop a data dependent approach that is used to derive generalization bounds that depend on the margin distr...
Ashutosh Garg, Sariel Har-Peled, Dan Roth