1568 search results - page 34 / 314 » The problem of examination questions in algorithmics |
ANTSW
2006
Springer
15 years 1 months ago
2006
Springer
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions f...
FUN
2007
Springer
15 years 1 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— This paper provides a novel solution for robocentric mapping using an autonomous mobile robot. The robot dynamic model is the standard unicycle model and the robot is a...
117
click to vote
ESA
2011
Springer
13 years 9 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
102
click to vote
EWSN
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...