Sciweavers

340 search results - page 14 / 68
» Approximate equality is no fuzzy equality
Sort
View
SPAA
2004
ACM
14 years 25 days ago
Balanced graph partitioning
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
Konstantin Andreev, Harald Räcke
STACS
2004
Springer
14 years 22 days ago
Lattices with Many Cycles Are Dense
Abstract We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Zn /Λ has n − 1 cycles of equal length with arbitrary precision. We al...
Mårten Trolin
SIAMJO
2000
88views more  SIAMJO 2000»
13 years 7 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
IAT
2003
IEEE
14 years 21 days ago
Asymmetric Multiagent Reinforcement Learning
A gradient-based method for both symmetric and asymmetric multiagent reinforcement learning is introduced in this paper. Symmetric multiagent reinforcement learning addresses the ...
Ville Könönen
CRYPTO
1993
Springer
131views Cryptology» more  CRYPTO 1993»
13 years 11 months ago
Hash Functions Based on Block Ciphers: A Synthetic Approach
Constructions for hash functions based on a block cipher are studied where the size of the hashcode is equal to the block length of the block cipher and where the key size is appro...
Bart Preneel, René Govaerts, Joos Vandewall...