Sciweavers

1964 search results - page 251 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
PASTE
2004
ACM
14 years 1 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 10 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
DCC
2000
IEEE
14 years 22 days ago
RD-Optimization of Hierarchical Structured Adaptive Vector Quantization for Video Coding
This paper contains two contributions to very-low-bitrate video coding. First, we show that in contrast to common practice incremental techniques for rate-distortion optimization ...
Marcel Wagner, Dietmar Saupe
CEC
2007
IEEE
13 years 10 months ago
Fitness inheritance in evolutionary and multi-objective high-level synthesis
Abstract—The high-level synthesis process allows the automatic design and implementation of digital circuits starting from a behavioral description. Evolutionary algorithms are v...
Christian Pilato, Gianluca Palermo, Antonino Tumeo...
IJAR
2008
83views more  IJAR 2008»
13 years 8 months ago
Decision-theoretic specification of credal networks: A unified language for uncertain modeling with sets of Bayesian networks
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be power...
Alessandro Antonucci, Marco Zaffalon