301 search results - page 45 / 61 » Probabilistic rough set approximations |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
WSC
2007
13 years 9 months ago
2007
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
ICDE
2010
IEEE
13 years 7 months ago
2010
IEEE
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
ICRA
2003
IEEE
14 years 25 days ago
2003
IEEE
— In this paper we present a novel method for robot path planning based on learning motion patterns. A motion pattern is defined as the path that results from applying a set of ...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
Service composition concerns both integration of heterogeneous distributed applications and dynamic selection of services. QoS-aware selection enables a service requester with cer...