4843 search results - page 565 / 969 » The Shortcut Problem - Complexity and Approximation |
134
Voted
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
174
click to vote
HICSS
2008
IEEE
15 years 5 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
162
click to vote
ALGORITHMICA
2008
15 years 5 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
111
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Sampled semantics of timed automata is a nite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems ed granularity of ti...
158
click to vote
AROBOTS
2006
15 years 5 months ago
2006
This paper aims at a discussion of the structure of the SLAM problem. The analysis is not strictly formal but based both on informal studies and mathematical derivation. The first ...