Sciweavers

316 search results - page 35 / 64
» Resource Combinatory Algebras
Sort
View
147
Voted
IPPS
2009
IEEE
15 years 10 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram
139
Voted
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 9 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
111
Voted
WCC
2005
Springer
122views Cryptology» more  WCC 2005»
15 years 9 months ago
Frequency/Time Hopping Sequences with Large Linear Complexities
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk ) by taking successive k-tuples of given sequences over GF(p). We are abl...
Yun-Pyo Hong, Hong-Yeop Song
136
Voted
SIBGRAPI
1999
IEEE
15 years 7 months ago
Developing Morphological Building Blocks: From Design to Implementation
Abstract. Mathematical morphology has become a widely used technique for image processing and computer vision. Initially designed as a set theory, it was generalized to the set of ...
Marcos Cordeiro d'Ornellas, Rein van den Boomgaard
PPDP
1999
Springer
15 years 7 months ago
Constraint Programming in OPL
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the rst modeling language to combine high-level algebraic and set notations f...
Pascal Van Hentenryck, Laurent Michel, Laurent Per...