1
Izdano 2005
Kazalo: ... Optical Networks -- A Parallel O(n27n/8) Time-Memory-Processor Tradeoff for Knapsack-Like Problems...
Polni tekst
Elektronski eKnjiga
2
Kazalo: ... Theorem -- Separation Results -- The Immerman-Szelepcsényi Theorem -- Logspace Computability...
Polni tekst
Elektronski eKnjiga
3
Izdano 2015
Kazalo: ...The Effect of Distinct Geometric Semantic Crossover Operators in Regression Problems -- Learning...
Polni tekst
Elektronski eKnjiga
4
Izdano 2013
Kazalo: ... Neural P Systems with Functional Astrocytes -- The Efficiency of Tissue P Systems with Cell Separation...
Polni tekst
Elektronski eKnjiga
5
Izdano 2006
Kazalo: ... Group Problems -- Canonical Decomposition of a Regular Factorial Language -- Acyclic Bidirected and Skew...
Polni tekst
Elektronski eKnjiga
6
Izdano 2008
Kazalo: ... Subgroup Problem -- An O *(3.523k ) Parameterized Algorithm for 3-Set Packing -- Indistinguishability...
Polni tekst
Elektronski eKnjiga
7
Izdano 2014
Kazalo: ... -- Looking at Separation Algebras with Boolean BI-eyes -- The Inhabitation Problem for Non-idempotent...
Polni tekst
Elektronski eKnjiga
8
Izdano 2006
Kazalo: ... -- On the Complexity of Parallel Hardness Amplification for One-Way Functions -- Secret Sharing and Multi-party...
Polni tekst
Elektronski eKnjiga
9
Izdano 2010
Kazalo: ... Stabbing -- Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput -- Online Function...
Polni tekst
Elektronski eKnjiga
10
Izdano 2015
Kazalo: ... for Probability Density Functions -- Segment Abstraction for Worst-Case Execution Time Analysis -- Automatic...
Polni tekst
Elektronski eKnjiga
11
Izdano 2010
Kazalo: ... -- LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation -- FGb: A Library...
Polni tekst
Elektronski eKnjiga
12
Izdano 2005
Kazalo: ... Rule-Table for Function Approximation by Use of Symbolic Regression in 1D and 2D Cases -- Parallel...
Polni tekst
Elektronski eKnjiga
13
Izdano 2005
Kazalo: ...Invited Papers -- Genome Halving Problem Revisited -- Verifying Probabilistic Procedural Programs...
Polni tekst
Elektronski eKnjiga
14
Izdano 2015
Kazalo: ... for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem -- Constant Approximation...
Polni tekst
Elektronski eKnjiga
15
Izdano 2013
Kazalo: ...Invited Talks -- The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi...
Polni tekst
Elektronski eKnjiga
16
Izdano 2010
Kazalo: ... Empty Rectangle and Square Problems in All Dimensions -- Connectivity Is Not a Limit for Kernelization...
Polni tekst
Elektronski eKnjiga
17
Izdano 2014
Kazalo: ... Software with Recursive Functions (Invited Contribution) -- Track A: Algorithms, Complexity, and Games Weak...
Polni tekst
Elektronski eKnjiga
18
Izdano 2005
Kazalo: ... Sphere Cut Branch Decompositions -- An Algorithm for the SAT Problem for Formulae of Linear Length...
Polni tekst
Elektronski eKnjiga
19
Izdano 2010
Kazalo: ... Networks -- Local Minima of a Quadratic Binary Functional with a Quasi-Hebbian Connection Matrix -- A...
Polni tekst
Elektronski eKnjiga
20
Izdano 2012
Kazalo: ... -- Theoretical Analysis of Function of Derivative Term in On-Line Gradient Descent Learning -- Some Comparisons...
Polni tekst
Elektronski eKnjiga