Sciweavers

5608 search results - page 752 / 1122
» On the Theory of Matchgate Computations
Sort
View
JUCS
2006
101views more  JUCS 2006»
15 years 6 months ago
DS/CDMA Multiuser Detection with Evolutionary Algorithms
This work analyses two heuristic algorithms based on the genetic evolution theory applied to direct sequence code division multiple access (DS/CDMA) communication systems. For diff...
Fernando Ciriaco, Taufik Abrão, Paul Jean E...
SIGOPS
2008
141views more  SIGOPS 2008»
15 years 6 months ago
Using model checkers in an introductory course on operating systems
During the last three years, we have been experimenting with the use of the Uppaal model checker in an introductory course on operating systems for first-year Computer Science stu...
Roelof Hamberg, Frits W. Vaandrager
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
15 years 6 months ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
AEPIA
2002
159views more  AEPIA 2002»
15 years 6 months ago
Analysing Rough Sets weighting methods for Case-Based Reasoning Systems
Case-Based Reasoning systems retrieve cases using a similarity function based on the K-NN or some derivatives. These functions are sensitive to irrelevant, interacting or noisy fe...
Maria Salamó, Elisabet Golobardes
CSUR
2004
91views more  CSUR 2004»
15 years 6 months ago
Line drawing, leap years, and Euclid
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
Mitchell A. Harris, Edward M. Reingold