5608 search results - page 746 / 1122 » On the Theory of Matchgate Computations |
155
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we set the first steps towards the development of a commercially viable tool that uses evolutionary computation to address the Product to Shelf Allocation Problem (P...
166
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
177
click to vote
KR
2000
Springer
15 years 10 months ago
2000
Springer
We investigate the problem of reasoning with partitions of related logical axioms. Our motivation is two-fold. First, we are concerned with how to reason effectively with multiple...
197
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
169
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
Abstract— Many asynchronous designs are naturally specified and implemented hierarchically as an interconnection of separate asynchronous modules that operate concurrently and c...