Sciweavers

590 search results - page 90 / 118
» Debugging Program Loops Using Approximate Modeling
Sort
View
NIPS
2008
15 years 7 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
15 years 7 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...
MSWIM
2005
ACM
15 years 12 months ago
Huginn: a 3D visualizer for wireless ns-2 traces
Discrete-event network simulation is a major tool for the research and development of mobile ad-hoc networks (MANETs). These simulations are used for debugging, teaching, understa...
Björn Scheuermann, Holger Füßler, ...
BIRTHDAY
2006
Springer
15 years 10 months ago
Data Flow Analysis for CCS
Data Flow Analysis as expressed by Monotone Frameworks is often associated with classical imperative programming languages and has played a crucial role in the efficient implementa...
Hanne Riis Nielson, Flemming Nielson
IPCO
2001
79views Optimization» more  IPCO 2001»
15 years 7 months ago
Synthesis of 2-Commodity Flow Networks
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
Refael Hassin, Asaf Levin