Sciweavers

3818 search results - page 228 / 764
» Word Problems on Compressed Words
Sort
View
ENDM
2000
131views more  ENDM 2000»
15 years 6 months ago
Some Topological Methods in Graph Coloring Theory
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
Bojan Mohar
DAM
2002
67views more  DAM 2002»
15 years 6 months ago
Optimal arrangement of data in a tree directory
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
Malwina J. Luczak, Steven D. Noble
JACM
2000
119views more  JACM 2000»
15 years 6 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
CORR
1998
Springer
164views Education» more  CORR 1998»
15 years 6 months ago
Training Reinforcement Neurocontrollers Using the Polytope Algorithm
A new training algorithm is presented for delayed reinforcement learning problems that does not assume the existence of a critic model and employs the polytope optimization algorit...
Aristidis Likas, Isaac E. Lagaris
INFORMATICALT
2002
191views more  INFORMATICALT 2002»
15 years 6 months ago
Optimal Control of a Well-Stirred Bioreactor in the Presence of Stochastic Perturbations
We study the stochastic model for bioremediation in a bioreactor with ideal mixing. The dynamics of the examined system is described by stochastic differential equations. We consid...
Vadim Azhmyakov