Sciweavers

1972 search results - page 386 / 395
» Hidden semi-Markov models
Sort
View
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
15 years 1 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
AIPS
2010
14 years 12 months ago
Shopper: A System for Executing and Simulating Expressive Plans
We present Shopper, a plan execution engine that facilitates experimental evaluation of plans and makes it easier for planning researchers to incorporate replanning. Shopper inter...
Robert P. Goldman, John Maraist
LISA
2007
14 years 12 months ago
Application Buffer-Cache Management for Performance: Running the World's Largest MRTG
An operating system’s readahead and buffer-cache behaviors can significantly impact application performance; most often these better performance, but occasionally they worsen it...
David Plonka, Archit Gupta, Dale Carder
CP
2008
Springer
14 years 11 months ago
Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies
Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications. ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
DIMVA
2008
14 years 11 months ago
Embedded Malware Detection Using Markov n-Grams
Embedded malware is a recently discovered security threat that allows malcode to be hidden inside a benign file. It has been shown that embedded malware is not detected by commerci...
M. Zubair Shafiq, Syed Ali Khayam, Muddassar Faroo...