Sciweavers

1224 search results - page 130 / 245
» Theory decision by decomposition
Sort
View
91
Voted
URBAN
2008
128views more  URBAN 2008»
15 years 21 days ago
Discerning landslide susceptibility using rough sets
Rough set theory has been primarily known as a mathematical approach for analysis of a vague description of objects. This paper explores the use of rough set theory to manage the ...
Pece V. Gorsevski, Piotr Jankowski
ATMOS
2010
134views Optimization» more  ATMOS 2010»
14 years 11 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
214
Voted
CORR
2012
Springer
286views Education» more  CORR 2012»
13 years 8 months ago
A Faster Algorithm for Solving One-Clock Priced Timed Games
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter ...
ICAART
2010
INSTICC
15 years 10 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
84
Voted
ALDT
2009
Springer
110views Algorithms» more  ALDT 2009»
15 years 7 months ago
Manipulating Tournaments in Cup and Round Robin Competitions
In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the ...
Tyrel Russell, Toby Walsh