5608 search results - page 799 / 1122 » On the Theory of Matchgate Computations |
167
click to vote
CSL
2007
Springer
16 years 27 days ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
129
click to vote
GECCO
2007
Springer
16 years 26 days ago
2007
Springer
In previous work [7] a computational framework was demonstrated that employs evolutionary algorithms to automatically model a given system. This is accomplished by alternating the...
185
click to vote
GECCO
2007
Springer
16 years 26 days ago
2007
Springer
In this paper, we utilize a predator-prey model in order to identify characteristics of single-objective variation operators in the multi-objective problem domain. In detail, we a...
158
click to vote
SEMWEB
2007
Springer
16 years 25 days ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
202
click to vote
TELETRAFFIC
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. To support battery powered mobile broadband wireless access devices efficiently, IEEE 802.16e defines a sleep mode operation for conserving the power of mobile terminals...