Sciweavers

2693 search results - page 354 / 539
» French Order Without Order
Sort
View
CSL
2010
Springer
15 years 4 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
EAAI
2008
106views more  EAAI 2008»
15 years 4 months ago
The distributed multilevel ant-stigmergy algorithm used at the electric-motor design
This article presents an optimization method used at the electric-motor design. The goal of the optimization was to find the geometrical parameter values that would generate the r...
Peter Korosec, Jurij Silc
CLEIEJ
2006
96views more  CLEIEJ 2006»
15 years 4 months ago
A Single-Version Algorithmic Approach to Fault Tolerant Computing Using Static Redundancy
This paper describes a single-version algorithmic approach to design in fault tolerant computing in various computing systems by using static redundancy in order to mask transient...
Goutam Kumar Saha
CORR
2006
Springer
124views Education» more  CORR 2006»
15 years 4 months ago
Next Generation Language Resources using GRID
This paper presents a case study concerning the challenges and requirements posed by next generation language resources, realized as an overall model of open, distributed and coll...
Federico Calzolari, Eva Sassolini, Manuela Sassi, ...
CORR
2006
Springer
160views Education» more  CORR 2006»
15 years 4 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer