Sciweavers

707 search results - page 118 / 142
» Solving path problems on the GPU
Sort
View
AIPS
2010
15 years 2 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
TCOM
2008
92views more  TCOM 2008»
14 years 11 months ago
Mailbox switch: a scalable two-stage switch architecture for conflict resolution of ordered packets
Abstract-- Traditionally, conflict resolution in an inputbuffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only nee...
Cheng-Shang Chang, Duan-Shin Lee, Ying-Ju Shih, Ch...
IJRR
2000
117views more  IJRR 2000»
14 years 11 months ago
Singularity-Consistent Parameterization of Robot Motion and Control
The inverse kinematics problem is formulated as a parameterized autonomous dynamical system problem, and respective analysis is carried out. It is shown that a singular point of w...
Dragomir N. Nenchev, Yuichi Tsumaki, Masaru Uchiya...
GLOBECOM
2010
IEEE
14 years 9 months ago
Column Generation for Dimensioning Resilient Optical Grid Networks with Relocation
Nowadays, the Quality of Service (QoS) in Optical Grids has become a key issue. An important QoS factor is the resiliency, namely the ability to survive from certain network failur...
Brigitte Jaumard, Jens Buysse, Ali Shaikh, Marc De...
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
15 years 3 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley