15485 search results - page 422 / 3097 » Computing Optimal Subsets |
284
click to vote
ASPLOS
2009
ACM
16 years 7 months ago
2009
ACM
As computational power increases, tele-immersive applications are an emerging trend. These applications make extensive demands on computational resources through their heavy use o...
161
click to vote
NETCOOP
2007
Springer
16 years 29 days ago
2007
Springer
Recently Gerald Ash has shown through case studies that event dependent routing is attractive in large scale multi-service MPLS networks. In this paper, we consider the application...
168
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
203
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
200
click to vote
ECAI
2004
Springer
16 years 6 days ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...