Sciweavers

868 search results - page 1 / 174
» Finding Most Likely Solutions
Sort
View
CIE
2007
Springer
13 years 6 months ago
Finding Most Likely Solutions
Abstract. As one simple type of statistical inference problems we consider Most Likely Solution problem, a task of finding a most likely solution (MLS in short) for a given proble...
Osamu Watanabe, Mikael Onsjö
SIGCSE
2002
ACM
178views Education» more  SIGCSE 2002»
13 years 4 months ago
Making compiler design relevant for students who will (most likely) never design a compiler
Compiler Design courses are a common component of most modern Computer Science undergraduate curricula. At the same time, however, compiler design has become a highly specialized ...
Saumya K. Debray
DEBS
2008
ACM
13 years 6 months ago
Top-k/w publish/subscribe: finding k most relevant publications in sliding time window w
Existing content-based publish/subscribe systems are designed assuming that all matching publications are equally relevant to a subscription. As we cannot know in advance the dist...
Kresimir Pripuzic, Ivana Podnar Zarko, Karl Aberer
PPSN
2004
Springer
13 years 10 months ago
Finding Knees in Multi-objective Optimization
Abstract. Many real-world optimization problems have several, usually conflicting objectives. Evolutionary multi-objective optimization usually solves this predicament by searchin...
Jürgen Branke, Kalyanmoy Deb, Henning Dierolf...
ICC
2009
IEEE
13 years 11 months ago
A Laplace Transform-Based Method to Stochastic Path Finding
—Finding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay, when link metrics are defined as random variables by known probabili...
Suleyman Uludag, Ziyneti Elif Uludag, Klara Nahrst...