Sciweavers

502 search results - page 46 / 101
» Monotone Approximation of Decision Problems
Sort
View
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 1 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
ICRA
2008
IEEE
167views Robotics» more  ICRA 2008»
15 years 4 months ago
An approximate algorithm for solving oracular POMDPs
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
Nicholas Armstrong-Crews, Manuela M. Veloso
EUSFLAT
2007
107views Fuzzy Logic» more  EUSFLAT 2007»
14 years 11 months ago
Extending the Choquet integral
In decision under uncertainty, the Choquet integral yields the expectation of a random variable with respect to a fuzzy measure (or non-additive probability or capacity). In gener...
Giovanni Rossi
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
14 years 11 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
INFOCOM
2012
IEEE
13 years 3 days ago
Maximizing system throughput by cooperative sensing in Cognitive Radio Networks
—Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the ...
Shuang Li, Zizhan Zheng, Eylem Ekici, Ness B. Shro...