Sciweavers

3736 search results - page 686 / 748
» Generative Programming
Sort
View
DM
2006
128views more  DM 2006»
13 years 11 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
JUCS
2008
186views more  JUCS 2008»
13 years 11 months ago
A Safe Dynamic Adaptation Framework for Aspect-Oriented Software Development
: One focus of current software development is the re-use of components in the construction of systems. Software Adaptation facilitates the consequent need to adapt these component...
Miguel Ángel Pérez Toledano, Amparo ...
VLSISP
2008
173views more  VLSISP 2008»
13 years 11 months ago
Fast Bit Gather, Bit Scatter and Bit Permutation Instructions for Commodity Microprocessors
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
Yedidya Hilewitz, Ruby B. Lee
AI
2002
Springer
13 years 11 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
BMCBI
2004
112views more  BMCBI 2004»
13 years 11 months ago
A double classification tree search algorithm for index SNP selection
Background: In population-based studies, it is generally recognized that single nucleotide polymorphism (SNP) markers are not independent. Rather, they are carried by haplotypes, ...
Peisen Zhang, Huitao Sheng, Ryuhei Uehara