Sciweavers

15421 search results - page 2924 / 3085
» Dependability
Sort
View
DM
2008
103views more  DM 2008»
15 years 7 months ago
Edge-colorings avoiding rainbow and monochromatic subgraphs
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
Maria Axenovich, Perry Iverson
AI
2006
Springer
15 years 7 months ago
Is real-valued minimax pathological?
Deeper searches in game-playing programs relying on the minimax principle generally produce better results. Theoretical analyses, however, suggest that in many cases minimaxing am...
Mitja Lustrek, Matjaz Gams, Ivan Bratko
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
15 years 7 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
Geeta Chaudhry, Thomas H. Cormen
ALMOB
2006
89views more  ALMOB 2006»
15 years 7 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
ENTCS
2008
106views more  ENTCS 2008»
15 years 7 months ago
Modelling Adaptive Systems in ForSyDe
Emerging architectures such as partially reconfigurable FPGAs provide a huge potential for adaptivity in the area of embedded systems. Since many system functions are only execute...
Ingo Sander, Axel Jantsch
« Prev « First page 2924 / 3085 Last » Next »