Sciweavers

4047 search results - page 151 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 6 months ago
Online Cake Cutting
We propose an online form of the cake cutting problem. This models situations where players arrive and depart during the process of dividing a resource. We show that well known fa...
Toby Walsh
IPL
2008
89views more  IPL 2008»
15 years 6 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
JAIR
2000
152views more  JAIR 2000»
15 years 6 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
13 years 8 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
CATS
2006
15 years 7 months ago
On the Logical Implication of Multivalued Dependencies with Null Values
The implication of multivalued dependencies (MVDs) in relational databases has originally been defined in the context of some fixed finite universe (Fagin 1977, Zaniolo 1976). Whi...
Sebastian Link