Sciweavers

1368 search results - page 170 / 274
» Generalized Rook Polynomials
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 5 months ago
Efficient Minimization of Decomposable Submodular Functions
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
Peter Stobbe, Andreas Krause
163
Voted
EAAI
2008
111views more  EAAI 2008»
15 years 5 months ago
Fuzzy conditional temporal problems: Strong and weak consistency
: In real life scenarios there is often the need for modelling conditional plans where external events determgine the actual execution sequence. Conditional Temporal Problems (CTPs...
Marco Falda, Francesca Rossi, Kristen Brent Venabl...
153
Voted
EOR
2008
110views more  EOR 2008»
15 years 5 months ago
Runway sequencing with holding patterns
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...
146
Voted
ECCC
2006
218views more  ECCC 2006»
15 years 5 months ago
Efficient Algorithms for Online Game Playing and Universal Portfolio Management
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
Amit Agarwal, Elad Hazan
IJAR
2008
95views more  IJAR 2008»
15 years 5 months ago
Complexity results for enhanced qualitative probabilistic networks
While quantitative probabilistic networks (QPNs) allow the expert to state influences between nodes in the network as influence signs, rather than conditional probabilities, infer...
Johan Kwisthout, Gerard Tel