Sciweavers

698 search results - page 20 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
77
Voted
IPL
2006
83views more  IPL 2006»
14 years 9 months ago
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
Claudson F. Bornstein, Celina M. Herrera de Figuei...
SIGACT
2010
74views more  SIGACT 2010»
14 years 8 months ago
Typically-correct derandomization
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
Ronen Shaltiel
ECCC
2010
80views more  ECCC 2010»
14 years 9 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
CASES
2010
ACM
14 years 7 months ago
Improved procedure placement for set associative caches
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
Yun Liang, Tulika Mitra
EUSFLAT
2007
129views Fuzzy Logic» more  EUSFLAT 2007»
14 years 11 months ago
Dealing with Incompleteness of Preferences in Group Decision Making Problems
While considering processes of decision making we often encounter the problem of incomplete information. In group decision making (GDM) problems each decision maker is supposed to...
Anna Pankowska