Sciweavers

3678 search results - page 6 / 736
» On the Stable Paths Problem
Sort
View
141
Voted
AROBOTS
2002
98views more  AROBOTS 2002»
15 years 3 months ago
Dynamically-Stable Motion Planning for Humanoid Robots
We present an approach to path planning for humanoid robots that computes dynamically-stable, collision-free trajectories from full-body posture goals. Given a geometric model of t...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...
114
Voted
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
15 years 8 months ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry
134
Voted
FOCS
2009
IEEE
15 years 10 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
122
Voted
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
15 years 3 months ago
Understanding the Generalized Median Stable Matchings
Let I be a stable matching instance with N stable matchings. For each man m, order his (not necessarily distinct) N partners from his most preferred to his least preferred. Denote...
Christine T. Cheng
122
Voted
TCS
2008
15 years 3 months ago
A unified approach to finding good stable matchings in the hospitals/residents setting
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
Christine Cheng, Eric McDermid, Ichiro Suzuki