Sciweavers

1968 search results - page 181 / 394
» The Complexity of Valued Constraint Models
Sort
View
AAIM
2007
Springer
126views Algorithms» more  AAIM 2007»
15 years 8 months ago
Mixed Criteria Packet Scheduling
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
Chad R. Meiners, Eric Torng
94
Voted
QEST
2006
IEEE
15 years 7 months ago
On Single-Class Load-Dependent Normalizing Constant Equations
Normalizing constant recurrence equations play an important role in the exact analysis of load-independent (LI) product-form queueing networks. However, they have not been extende...
Giuliano Casale
UAI
2001
15 years 3 months ago
UCP-Networks: A Directed Graphical Representation of Conditional Utilities
We propose a directed graphical representation of utility functions, called UCP-networks, that combines aspects of two existing preference models: generalized additive models and ...
Craig Boutilier, Fahiem Bacchus, Ronen I. Brafman
139
Voted
IJCV
2008
172views more  IJCV 2008»
15 years 1 months ago
Nonparametric Bayesian Image Segmentation
Image segmentation algorithms partition the set of pixels of an image into a specific number of different, spatially homogeneous groups. We propose a nonparametric Bayesian model f...
Peter Orbanz, Joachim M. Buhmann
BMCBI
2010
150views more  BMCBI 2010»
15 years 2 months ago
Systematic calibration of a cell signaling network model
Background: Mathematical modeling is being applied to increasingly complex biological systems and datasets; however, the process of analyzing and calibrating against experimental ...
Kyoung Ae Kim, Sabrina L. Spencer, John G. Albeck,...