Sciweavers

219 search results - page 16 / 44
» Is the World Linear
Sort
View
NHM
2010
87views more  NHM 2010»
13 years 2 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
DEON
2010
Springer
13 years 9 months ago
A Dyadic Operator for the Gradation of Desirability
We propose a normal modal deontic logic based on a dyadic operator, similar in structure to the temporal "until". By bringing significant expressiveness to the logic, it ...
Guillaume Piolle
ATMOS
2008
187views Optimization» more  ATMOS 2008»
13 years 9 months ago
Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
Karl Nachtigall, Jens Opitz
AIIDE
2008
13 years 10 months ago
Integrating Drama Management into an Adventure Game
Often, video game designers must choose between creating a linear experience, and designing an open world with many different story lines that fail to form a tightly crafted narra...
Anne Sullivan, Sherol Chen, Michael Mateas
JMLR
2007
58views more  JMLR 2007»
13 years 7 months ago
Distances between Data Sets Based on Summary Statistics
The concepts of similarity and distance are crucial in data mining. We consider the problem of defining the distance between two data sets by comparing summary statistics compute...
Nikolaj Tatti