613 search results - page 27 / 123 » The Memory Fragmentation Problem: Solved |
147
Voted
ICTAI
2010
IEEE
15 years 14 days ago
2010
IEEE
When a local optimal solution is reached with classical Particle Swarm Optimization (PSO), all particles in the swarm gather around it, and escaping from this local optima becomes...
86
Voted
CADE
2001
Springer
16 years 2 months ago
2001
Springer
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
119
Voted
POPL
1995
ACM
15 years 6 months ago
1995
ACM
We present a variant of the Standard ML module system rameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compattract types, inst...
90
Voted
LICS
2010
IEEE
15 years 29 days ago
2010
IEEE
We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phas...
124
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...