Sciweavers

6546 search results - page 470 / 1310
» Improving the Performance of the RISE Algorithm
Sort
View
WECWIS
2005
IEEE
121views ECommerce» more  WECWIS 2005»
16 years 13 days ago
Matching Composed Semantic Web Services at Publishing Time
This paper describes an algorithm optimizing the discovery process for composed semantic web services. The algorithm can be used to improve discovery of appropriate component servi...
Andreas Friesen, Michael Altenhofen
188
Voted
WAOA
2004
Springer
127views Algorithms» more  WAOA 2004»
16 years 6 days ago
Better Bounds for Minimizing SONET ADMs
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
Leah Epstein, Asaf Levin
ICRA
2002
IEEE
72views Robotics» more  ICRA 2002»
15 years 11 months ago
Distributed and Dynamic Task Reallocation in Robot Organizations
Task reallocation in a multi-robot organization is a process that distributes a decomposed global task to individual robots. This process must be distributed and dynamic because i...
Wei-Min Shen, Behnam Salemi
COLT
2000
Springer
15 years 11 months ago
Estimation and Approximation Bounds for Gradient-Based Reinforcement Learning
We model reinforcement learning as the problem of learning to control a Partially Observable Markov Decision Process (  ¢¡¤£¦¥§  ), and focus on gradient ascent approache...
Peter L. Bartlett, Jonathan Baxter
ICRA
1994
IEEE
98views Robotics» more  ICRA 1994»
15 years 11 months ago
Efficient Distance Computation Between Non-Convex Objects
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
Sean Quinlan