Sciweavers

540 search results - page 86 / 108
» Competitive Routing over Time
Sort
View
UAI
2003
13 years 11 months ago
Marginalizing Out Future Passengers in Group Elevator Control
Group elevator scheduling is an NP-hard sequential decision-making problem with unbounded state spaces and substantial uncertainty. Decision-theoretic reasoning plays a surprising...
Daniel Nikovski, Matthew Brand
WSC
1997
13 years 11 months ago
Integrating Distributed Simulation Objects
Creating comprehensive simulation models can be expensive and time consuming. This paper discusses our efforts to develop a general methodology that will allow users to quickly an...
Joseph A. Heim
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 10 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
EOR
2007
108views more  EOR 2007»
13 years 10 months ago
Measuring retail company performance using credit scoring techniques
This paper proposes a theoretical framework for predicting financial distress based on Hunt’s (2000) Resource-Advantage Theory of Competition. The study focuses on the US retail...
Yu-Chiang Hu, Jake Ansell
EDBT
2009
ACM
165views Database» more  EDBT 2009»
13 years 8 months ago
Exploiting the power of relational databases for efficient stream processing
Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a di...
Erietta Liarou, Romulo Goncalves, Stratos Idreos