Sciweavers

4103 search results - page 66 / 821
» Some results on the Collatz problem
Sort
View
LATA
2009
Springer
15 years 6 months ago
Decision Problems for Convex Languages
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...
Janusz A. Brzozowski, Jeffrey Shallit, Zhi Xu
CP
2007
Springer
15 years 6 months ago
Dealing with Incomplete Preferences in Soft Constraint Problems
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possibl...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
FUN
2010
Springer
254views Algorithms» more  FUN 2010»
15 years 4 months ago
The Urinal Problem
Abstract. A man walks into a men’s room and observes n empty urinals. Which urinal should he pick so as to maximize his chances of maintaining privacy, i.e., minimize the chance ...
Evangelos Kranakis, Danny Krizanc
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
15 years 4 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...
ALENEX
2008
133views Algorithms» more  ALENEX 2008»
15 years 1 months ago
Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem
The multi-period newsvendor problem describes the dilemma of a newspaper salesman--how many paper should he purchase each day to resell, when he doesn't know the demand? We d...
Shawn O'Neil, Amitabh Chaudhary