Sciweavers

154 search results - page 22 / 31
» Anytime search in dynamic graphs
Sort
View
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
13 years 6 months ago
Global reachability and path planning for planetary exploration with montgolfiere balloons
Aerial vehicles are appealing systems for possible future exploration of planets and moons such as Venus and Titan, because they combine extensive coverage with highresolution data...
Lars Blackmore, Yoshiaki Kuwata, Michael T. Wolf, ...
CIKM
2008
Springer
13 years 10 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
14 years 2 months ago
Towards the coevolution of cellular automata controllers for chemical computing with the B-Z reaction
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...
Christopher Stone, Rita Toth, Andrew Adamatzky, Be...
ATMOS
2008
139views Optimization» more  ATMOS 2008»
13 years 10 months ago
Efficient On-Trip Timetable Information in the Presence of Delays
Abstract. The search for train connections in state-of-the-art commercial timetable information systems is based on a static schedule. Unfortunately, public transportation systems ...
Lennart Frede, Matthias Müller-Hannemann, Mat...
GECCO
2009
Springer
200views Optimization» more  GECCO 2009»
14 years 3 months ago
Apply ant colony optimization to Tetris
Tetris is a falling block game where the player’s objective is to arrange a sequence of different shaped tetrominoes smoothly in order to survive. In the intelligence games, ag...
Xingguo Chen, Hao Wang, Weiwei Wang, Yinghuan Shi,...