Sciweavers

297 search results - page 42 / 60
» Combining Multiple Heuristics Online
Sort
View
AAAI
1997
13 years 9 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
CN
2006
107views more  CN 2006»
13 years 7 months ago
Sub-graph routing: A generalized fault-tolerant strategy for link failures in WDM optical networks
Single- and multiple-link failure resilience are of critical importance in survivable wavelength division multiplexed (WDM) optical network design. Networks are not made up simply...
Michael T. Frederick, Pallab Datta, Arun K. Somani
IJPP
2007
56views more  IJPP 2007»
13 years 7 months ago
Fault-aware Communication Mapping for NoCs with Guaranteed Latency
As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival prob...
Sorin Manolache, Petru Eles, Zebo Peng
TSC
2010
159views more  TSC 2010»
13 years 2 months ago
A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers
Today's data centers offer IT services mostly hosted on dedicated physical servers. Server virtualization provides a technical means for server consolidation. Thus, multiple v...
Benjamin Speitkamp, Martin Bichler
ICCV
2009
IEEE
15 years 15 days ago
Optimal Correspondences from Pairwise Constraints
Correspondence problems are of great importance in computer vision. They appear as subtasks in many applications such as object recognition, merging partial 3D reconstructions a...
Olof Enqvist, Klas Josephson, Fredrik Kahl