Sciweavers

798 search results - page 135 / 160
» Using Genetic Algorithms for Solving Hard Problems in GIS
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 7 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...
IJRR
2008
139views more  IJRR 2008»
13 years 7 months ago
Learning to Control in Operational Space
One of the most general frameworks for phrasing control problems for complex, redundant robots is operational space control. However, while this framework is of essential importan...
Jan Peters, Stefan Schaal
CEC
2009
IEEE
14 years 2 months ago
Dispatching rules for production scheduling: A hyper-heuristic landscape analysis
— Hyper-heuristics or “heuristics to chose heuristics” are an emergent search methodology that seeks to automate the process of selecting or combining simpler heuristics in o...
Gabriela Ochoa, José Antonio Vázquez...
ICRA
2009
IEEE
112views Robotics» more  ICRA 2009»
14 years 2 months ago
Combining planning and motion planning
Abstract— Robotic manipulation is important for real, physical world applications. General Purpose manipulation with a robot (eg. delivering dishes, opening doors with a key, etc...
Jaesik Choi, Eyal Amir