5169 search results - page 610 / 1034 » Locality approximation using time |
177
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
234
click to vote
EVOW
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
158
click to vote
CEC
2005
IEEE
16 years 19 days ago
2005
IEEE
Abstract- Finding Golomb rulers is an extremely challenging optimization problem (with many practical applications) that has been approached by a variety of search methods in recen...
157
click to vote
MSE
2005
IEEE
16 years 18 days ago
2005
IEEE
A graduate-level computer engineering course sequence at the OGI School of Science and Engineering teaches state-of-the-art digital system design practices and system-on-chip desi...
205
click to vote
DSVIS
2005
Springer
16 years 16 days ago
2005
Springer
The calculus outlined in this paper provides a formal architectural framework for describing and reasoning about the properties of multi-user and mobile distributed interactive sys...