Sciweavers

1102 search results - page 112 / 221
» Dynamic Constraint Models for Planning and Scheduling Proble...
Sort
View
GEOINFORMATICA
2006
86views more  GEOINFORMATICA 2006»
13 years 9 months ago
Decreasing Computational Time of Urban Cellular Automata Through Model Portability
This paper investigates how portability of a model between different computer operating systems can lead to increased efficiency in code execution. The portability problem is not a...
Charles Dietzel, Keith C. Clarke
TSMC
1998
82views more  TSMC 1998»
13 years 8 months ago
To push or not to push: on the rearrangement of movable objects by a mobile robot
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
Ohad Ben-Shahar, Ehud Rivlin
CCE
2004
13 years 8 months ago
Efficient short-term scheduling of refinery operations based on a continuous time formulation
The problem addressed in this work is to develop a comprehensive mathematical programming model for the efficient scheduling of oil-refinery operations. Our approach is first to d...
Zhenya Jia, Marianthi G. Ierapetritou
ATAL
2007
Springer
14 years 3 months ago
Scaling-up shopbots: a dynamic allocation-based approach
In this paper we consider the problem of eCommerce comparison shopping agents (shopbots) that are limited by capacity constraints. In light of the phenomenal increase both in dema...
David Sarne, Sarit Kraus, Takayuki Ito
RTS
2006
115views more  RTS 2006»
13 years 8 months ago
Resource access control for dynamic priority distributed real-time systems
Many of today's complex computer applications are being modeled and constructed using the principles inherent to real-time distributed object systems. In response to this dem...
Chen Zhang, David Cordes