1615 search results - page 264 / 323 » Computer science and decision theory |
111
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
130
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
145
click to vote
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
158
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
136
click to vote
NIPS
2004
15 years 5 months ago
2004
We propose a new interpretation of spiking neurons as Bayesian integrators accumulating evidence over time about events in the external world or the body, and communicating to oth...