Sciweavers

1792 search results - page 269 / 359
» Improved scheduling in rings
Sort
View
JMLR
2010
141views more  JMLR 2010»
14 years 6 months ago
FastInf: An Efficient Approximate Inference Library
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
Ariel Jaimovich, Ofer Meshi, Ian McGraw, Gal Elida...
INFOCOM
2011
IEEE
14 years 2 months ago
Optimized asynchronous multi-channel neighbor discovery
—We consider the problem of neighbor discovery in wireless networks with nodes operating in multiple frequency bands and with asymmetric beacon intervals. This is a challenging t...
Niels Karowski, Aline Carneiro Viana, Adam Wolisz
ICDE
2004
IEEE
108views Database» more  ICDE 2004»
16 years 16 days ago
Priority Mechanisms for OLTP and Transactional Web Applications
Transactional workloads are a hallmark of modern OLTP and Web applications, ranging from electronic commerce and banking to online shopping. Often, the database at the core of the...
David T. McWherter, Bianca Schroeder, Anastassia A...
ATAL
2009
Springer
15 years 5 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
15 years 5 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi