Sciweavers

9405 search results - page 1308 / 1881
» Computing a Model of Set Theory
Sort
View
CORR
2010
Springer
138views Education» more  CORR 2010»
15 years 7 months ago
Optimal Path Planning under Temporal Logic Constraints
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
Stephen L. Smith, Jana Tumova, Calin Belta, Daniel...
DATAMINE
2010
166views more  DATAMINE 2010»
15 years 7 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
CSDA
2008
122views more  CSDA 2008»
15 years 7 months ago
Time-adaptive quantile regression
An algorithm for time-adaptive quantile regression is presented. The algorithm is based on the simplex algorithm, and the linear optimization formulation of the quantile regressio...
Jan Kloppenborg Møller, Henrik Aalborg Niel...
CN
2006
70views more  CN 2006»
15 years 7 months ago
Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue
We first study the distribution of path duration in multi-hop wireless networks. We show that as the number of hops along a path increases, the path duration distribution can be a...
Yijie Han, Richard J. La, Armand M. Makowski, Seun...
EOR
2007
159views more  EOR 2007»
15 years 7 months ago
Solving the semi-desirable facility location problem using bi-objective particle swarm
In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation...
Haluk Yapicioglu, Alice E. Smith, Gerry V. Dozier
« Prev « First page 1308 / 1881 Last » Next »